GraphMatcher makes multiple global alignments of graphs. Given as input a set of directed or undirected graphs, it returns a mapping among the corresponding nodes of all the graphs.
The graphs to be aligned don't need to be identical (isomorphic), or even have the same number of nodes. GraphMatcher finds the best mapping of nodes regardless of the differences among the input graphs.
The software can generate a dendrogram to visualize the clustering of all the graphs. Furthermore, it is possible to know the maximum common subgraph of any sub-cluster.