in reply to How to compare two undirected graphs?
I don't understand what do you mean by comparison here. DO you want to know how the nodes are connected then you may look into a module called Graph::Undirected.
It will let you know how the graphs are linked and accordingly you may use the something like hash of arrays where the vertex between 2 nodes as a key and array will the weights. I think then you may compare the graphs.
|
|---|