test if graph is Eulerian
find Eulerian path
The IsEulerian command returns true if the input graph is an Eulerian graph, i.e there exists a closed walk in the graph that uses each edge exactly once. It returns false otherwise.
An optional second argument T is assigned an Eulerian Trail of the graph if such a trail exists, and FAIL otherwise.
The FindEulerianPath commandreturns a list corresponding to an Eulerian trail if one exists, and NULL otherwise.
The algorithm used to construct the Eulerian trail is depth-first-search. The complexity is O⁡n+m where n=|V| and m=|E|.
The GraphTheory[FindEulerianPath] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document
What kind of issue would you like to report? (Optional)