问题
I read a lot of theory on computing graph edit distance (GED), or other graph similarity measures (such as http://goo.gl/gmDMgA) but I'm failing to find tools to accomplish such computations.
Is there a programming library or softwares that computes graph edit distances, or, once again, any other graph similarity measures, between two graphs?
回答1:
There are at least three possibilities for software to compute graph edit distance:
GEDEVO, is a software tool for solving the network alignment problem. GEDEVO stands for Graph Edit Distance + EVOlution and it utilizes the evolutionary computing strategies for solving the so-called Graph Edit Distance problem.
graph mapping distance matrix generator is parallel Java code which generates a graph mapping distance matrix. It is related to frequent subgraph mining based on the REAFUM algorithm.
GRAPH EDIT DISTANCE : A NEW BINARY LINEAR FORMULATION from the paper New binary linear programming formulation to compute the graph edit distance
** You can find other Python, Java, and C++ implementations by searching sourceForge and gitHub.
回答2:
https://github.com/haakondr/graph-edit-distance-python
I implement one by myself. It's not that hard. See "BRIDGING THE GAP BETWEEN GRAPH EDIT DISTANCE AND KERNEL MACHINES".
回答3:
GMatch4py
It has multiple algorithms with additional functions beyond GED. The repository has instructions and examples. The install is also pretty easy.
来源：https://stackoverflow.com/questions/24416625/tools-to-compute-graph-edit-distance-ged