Compute the Structural Hamming Distance (SHD) between two graphs. In
simple terms, this is the number of edge insertions, deletions or
flips in order to transform one graph to another graph.
Usage
shd(g1,g2)
Arguments
g1
Graph object
g2
Graph object
Value
The value of the SHD (numeric).
References
I. Tsamardinos, L.E. Brown and C.F. Aliferis (2006).
The Max-Min Hill-Climbing Bayesian Network Structure Learning
Algorithm. JMLR65, 31--78.