|
|
|
| No such thing as a small change | |
| PerlMonks |
Re: How to compare two undirected graphs?by juampatronics (Initiate) |
| on Oct 18, 2010 at 08:58 UTC ( [id://865894]=note: print w/replies, xml ) | Need Help?? |
|
Your question is far too vague. Go have a look at the Graph module. You can just define your own comparison by overloading the eq member of that class. As for ranking nodes: you need to define a criteria first. Most likely you'll find what you need in that module.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||||||