Hello,
I get the following bug on canonical labeling of a nice symmetric
directed graph.
{{{
sage: G1 = DiGraph(loops=True,multiedges=True)
sage: G1.add_edges([
... (0, 0, 'c'), (0, 4, 'b'), (0, 5, 'c'), (0, 5, 't'), (1, 1,
'c'),
... (1, 3,'c'), (1, 3, 't'), (1, 5, 'b'), (2, 2, 'c'), (2, 3,
'b'),
... (2, 4, 'c'),(2, 4, 't'), (3, 1, 't'), (3, 2, 'b'), (3, 2,
'c'),
... (3, 4, 'c'), (4, 0,'b'), (4, 0, 'c'), (4, 2, 't'), (4, 5, 'c'),
... (5, 0, 't'), (5, 1, 'b'),(5, 1, 'c'), (5, 3, 'c')])
sage: G2 = G1.relabel(perm={0:4,1:5,2:3,3:2,5:0},inplace=False)
sage: G1.is_isomorphic(G2,edge_labels=True)
False
}}}
The problem appears in sage-4.7 but as far as I remember run nicely in
earlier version. Could somebody confirm that the following code run
nicely in sage-4.6 (I have no more compiled version of sage-4.6) ?
Thanks,
Vincent
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
