 |
BUILT-IN MATHEMATICA SYMBOL
FindEulerianCycle[g]
finds an Eulerian cycle in the graph g.
FindEulerianCycle[g, k]
finds at most k Eulerian cycles.
Details
- An Eulerian cycle is a cycle that traverses every edge exactly once.
- FindEulerianCycle returns a list of paths consisting of Eulerian cycles.
- FindEulerianCycle returns the list
if no Eulerian cycles exist. - FindEulerianCycle[g] is equivalent to FindEulerianCycle[g, 1].
- FindEulerianCycle[g, All] finds all Eulerian cycles in the graph g.
New in 8 | Last modified in 9
