Couvreur (SCCs Strongly Connected Components)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(V+E)$

Space Complexity

$O(V)$? words

(can be easily derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1999

Reference

https://link.springer.com/chapter/10.1007/3-540-48119-2_16