Hong’s algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(V(V+E))$

Space Complexity

$O(V+E)$? words

(Building recursive subgraphs)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2013

Reference

https://stanford-ppl.github.io/website/papers/sc13-hong.pdf