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 reply to Re: How to compare two undirected graphs?
by juampatronics
in thread How to compare two undirected graphs?
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |