Fleury's algorithm + Tarjan (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph)
Jump to navigation
Jump to search
Time Complexity
$O(E^{2})$
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
1974
Reference
https://collaborate.princeton.edu/en/publications/a-note-on-finding-the-bridges-of-a-graph