Munro’s algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki
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