Munro’s algorithm (SCCs Strongly Connected Components)
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.ezproxy.canberra.edu.au/science/article/pii/0020019071900068