|
|
|
| Keep It Simple, Stupid | |
| PerlMonks |
Re: How to compare two undirected graphs?by Herkum (Parson) |
| on Oct 18, 2010 at 08:01 UTC ( [id://865885]=note: print w/replies, xml ) | Need Help?? |
|
How do you define, "Compare"? Which nodes are there, which nodes are not? What about the order of nodes? Perhaps you should figure out what you need before you try to compare two graphs.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||||||