Module algorithms_edu::algo::graph::eulerian_path

Implementation of finding an Eulerian Path on a graph. This implementation verifies that the input graph is fully connected and supports self loops and repeated edges between nodes.

Time Complexity: $O(E)$

Resources

• W. Fiset's video 1
• W. Fiset's video 2

Enums

EulerianPathError