Tarjan's strongly connected components algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki

Revision as of 10:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V+E)$ == Space Complexity == $O(V)$ words (https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0020019015001532) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1972 == Reference == https://www.semanticscholar.org/paper/Depth-First-Search-and-Linear-Graph-Algorithms-Tarjan/385742fffcf113656f0d3cf6c06ef95cb8439dc6")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(V+E)$

Space Complexity

$O(V)$ words

(https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0020019015001532)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1972

Reference

https://www.semanticscholar.org/paper/Depth-First-Search-and-Linear-Graph-Algorithms-Tarjan/385742fffcf113656f0d3cf6c06ef95cb8439dc6

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Tarjan%27s_strongly_connected_components_algorithm_(SCCs_Strongly_Connected_Components)&oldid=44580"