Path-based depth-first search Gabow (SCCs Strongly Connected Components)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(V+E)$

Space Complexity

$O(V+E)$ total, $O(V)$ auxiliary? words

(https://www.sciencedirect.com/science/article/pii/S002001900000051X?via%3Dihub)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2000

Reference

https://www.sciencedirect.com/science/article/pii/S002001900000051X?via%3Dihub

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Path-based_depth-first_search_Gabow_(SCCs_Strongly_Connected_Components)&oldid=44584"