|
|
|
| Welcome to the Monastery | |
| PerlMonks |
Re: How to compare two undirected graphs?by snape (Pilgrim) |
| on Oct 18, 2010 at 08:22 UTC ( [id://865889]=note: print w/replies, xml ) | Need Help?? |
|
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.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||||||