Hi Nathannnnnnnnnnnnnnnnnnnnnnn, I am trying to compute isomorphisms of (partial) crystal graphs and use the digraph is_isomorphic method for this. More precisely, if G and G1 are digraphs I would like
G1.is_isomorphic(G,edge_labels=True) This is pretty slow in my examples (with graphs of about 1100 nodes). However, my graphs are directed with one generator at the top, so in principle there should be an efficient way of doing this. Is there already a better method in Sage that uses this property of the graph? Thank you, Anne -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-combinat-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-combinat-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
