Hierholzer's algorithm (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(E)$

Space Complexity

$O(E)$ words

(Keep track of current path + remaining edges needed to be traversed)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1873

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Hierholzer%27s_algorithm_(Constructing_Eulerian_Trails_in_a_Graph_Constructing_Eulerian_Trails_in_a_Graph)&oldid=45314"