Munro’s algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki

Revision as of 09:34, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(E + V \log V)$

Space Complexity

$O(V)$? words

(can be easily derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1971

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Munro’s_algorithm_(SCCs_Strongly_Connected_Components)&oldid=47345"