Hong’s algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki
Revision as of 11:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

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