Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re: How to compare two undirected graphs?

by Herkum (Parson)
on Oct 18, 2010 at 08:01 UTC ( #865885=note: print w/ replies, xml ) Need Help??


in reply to How to compare two undirected graphs?

How do you define, "Compare"? Which nodes are there, which nodes are not? What about the order of nodes? Perhaps you should figure out what you need before you try to compare two graphs.


Comment on Re: How to compare two undirected graphs?

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://865885]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (14)
As of 2014-07-30 13:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (233 votes), past polls