in reply to How to compare two undirected graphs?

Can you define what exactly you mean by top and bottom nodes? For example, is it the case that there's a unique shortest path from the top node to any node? That, for example, would be a managable case.

  • Comment on Re: How to compare two undirected graphs?