Kosaraju's algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V+E)$ == Space Complexity == $O(V+E)$ words (auxiliary data structures take up at most that much space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1978 == Reference == https://www.sciencedirect.com/science/article/pii/0898122181900080")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V+E)$

Space Complexity

$O(V+E)$ words

(auxiliary data structures take up at most that much space)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1978

Reference

https://www.sciencedirect.com/science/article/pii/0898122181900080

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