distance between two graphs embedded in 2D
Apologies if the answer is obvious...
I'm not a Sage user, but I found about it looking for a way to estimate the distance between two graphs, and it seems a very powerful tool.
The graphs live in 2D, and each node is characterized by two coordinates and a list of nodes it is connected to.
Graphs are not directed and not necessarily connected. Also note that the node labels are arbitrarily chosen from one graph to the other.
I cannot upload an image, nor post a link to it - sorry (no karma).
As a starting point, I'd like to estimate the graphs distance depending on the corresponding nodes position.
There is a way in SAGE to estimate their "distance" ?
I know a way could be to use the Laplacian operator and in SAGE I see it present (http://doc.sagemath.org, generic_graph.html), but I don't understand if SAGE supports graphs defined as mine...
Thanks for any help
Alessandro
