Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:

Sort of a meta-question here.

I'm trying to come up with a simple algorithm for comparing the shape of two undirected graphs. Each node in the graph has a "name" (which is meaningless for this comparison), a property (called the "width and length ratio" but here has nothing to do with the structure of the graph, just that the nominally same node in the two compared graphs should have the same w/l ratio), and zero or more unordered child-nodes that the graph is connected to. There are well-defined "top" and "bottom" nodes, but the middle is a bit messier, as multiple nodes may connect to the same node.

Does anyone have an idea of what I could use as a ranking criterion here? Or better yet, if there were a module that could do this sort of calculation for me I would just be absolutely elated.

I Appreciate the advice.