Hello Anne, Yes, this is a bug! I have posted a fix at #10549.
On Thu, Mar 10, 2011 at 7:38 AM, Anne Schilling <a...@math.ucdavis.edu> wrote: > Hi Robert, > > Thank you for your work on this! > > However, there is one more thing that would be very handy to have. > Namely, if one specifies certify=True in the isomorphism check, the > result is a bijection between the vertices of the graph: > > sage: D = digraphs.RandomDirectedGNP(6, .2) > sage: D.is_isomorphic(D, certify = True) > (True, {0: 0, 1: 1, 2: 2, 3: 3, 4: 4, 5: 5}) > > If in addition one specifies edge_labels=True this changes to some > labeling of an extended digraph(?): > > sage: D.is_isomorphic(D,edge_labels=True, certify = True) > {0: 0, 1: 1, 2: 2, 3: 3, 4: 4, 5: 5, 6: 6, 7: 7, 8: 8, 9: 9, 10: 10} > > Would it be possible to give as the output again the isomorphism of the > vertices? That would be the most natural in the setting of crystal > isomorphisms that I need. Or is there another easy way to obtain > the vertex isomorphism from the current code? > > Best, > > Anne > > > On 12/22/10 9:44 AM, Robert Miller wrote: >> >> On Dec 17, 6:38 pm, Anne Schilling<a...@math.ucdavis.edu> wrote: >>> >>> Thank you, very nice! However, playing around with this, also in the >>> setting of crystals, >>> I came across the following bug: ... >> >> Please see trac #10516. > -- Robert L. Miller http://www.rlmiller.org/ -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.