I think I see what I need to do. Create a dummy class C which is hashable and immutable. Have a dictionary which has objects of C and planar graphs. Every time I create a planar graph, see if it is isomorphic to one in the dictionary. If not add it to the dictionary. Is this sensible?
This is technical for a newbie. Is there any code I could look at? Thanks Bruce -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
