Is there a function to do an Eulerian cycle of a digraph? eulerian_cycle works on undirected graphs, but not on digraphs. Basically I'm looking for an equivalent to Mathematica's EulerianCycle. Does this exist?
Thanks in advance.
asked Jan 06 '11Eviatar Bach
474 ● 2 ● 10 ● 26
Are you sure about
I would say this is a start.
In fact, the code basically finds the circuit, but doesn't keep it like
However, things get bad when we convert, because it doesn't keep double edges... hmmm...
Anyway, this could probably be implemented pretty easily. I highly suggest you post about this on sage-devel, and/or file a ticket at trac.sagemath.org if one doesn't already exist for this.
posted Jan 06 '11kcrisman
6639 ● 13 ● 66 ● 150
Asked: Jan 06 '11
Seen: 130 times
Last updated: Jan 06 '11
powered by ASKBOT version 0.7.22
Copyright Sage, 2010. Some rights reserved under creative commons license.