Eulerian Paths

A path using every edge exactly once.

Advanced

Exists (undirected) when 0 or 2 vertices have odd degree; found with Hierholzer's algorithm in $O(E)$ .

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)