graph

graph / EulerianCycle / 0.1.0

README.md
This algorithm will check whether a graph is Eulerian (hence it contains an Eulerian cycle), and if so, return a list of vertices making up the Eulerian cycle.

An Eulerian circuit is a circuit which traverses each edge exactly once.