Hi Robert and William!
Thanks for your pointers!
devel/sage/sage/graphs seems to be solely dealing with undirected graphs.
What I would really like to have is isomorphisms between colored directed graphs
such as
sage: T = CrystalOfTableaux(['A',2],shape=[2])
sage: T.plot()
or
sage: view(T,
Anne,
The digraphs in sage also have isomorphism/automorphism groups
implemented. The pointer William gave you is for undirected graphs,
but if you go up a level you see much more generality...
sage: D = digraphs.RandomDirectedGNP(10, .2)
sage: E = digraphs.RandomDirectedGNP(10, .2)
sage:
Hi Robert!
Thank you, very nice! However, playing around with this, also in the setting of
crystals,
I came across the following bug:
sage: D = digraphs.RandomDirectedGNP(10, .2)
sage: E = digraphs.RandomDirectedGNP(10, .2)
sage: D.is_isomorphic(E, certify=True, edge_labels=True)
(False, None)
