Functions measuring similarity using graph edit distance.
The graph edit distance is the number of edge/node changes needed to make two graphs isomorphic.
The default algorithm/implementation is sub-optimal for some graphs.
The problem of finding the exact Graph Edit Distance (GED) is NP-hard
so it is often slow. If the simple interface
takes too long for your graph, try
At the same time, I encourage capable people to investigate alternative GED algorithms, in order to improve the choices available.
||Returns GED (graph edit distance) between graphs G1 and G2.|
||Returns all minimum-cost edit paths transforming G1 to G2.|
||Returns consecutive approximations of GED (graph edit distance) between graphs G1 and G2.|
||GED (graph edit distance) calculation: advanced interface.|