Path-based strong components algorithm; Dijkstra (SCCs Strongly Connected Components)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(V+E)$

Space Complexity

$O(V)$ words

(constant number of auxiliary stacks?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1976

Reference

https://www.worldcat.org/title/discipline-of-programming/oclc/1958445

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Path-based_strong_components_algorithm;_Dijkstra_(SCCs_Strongly_Connected_Components)&oldid=44581"