Tarjan's DFS based algorithm (Topological Sorting Topological Sorting)

From Algorithm Wiki
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V+E)$ == Space Complexity == $O(V)$ auxiliary? words (maintain O(V)-sized recursion stack, along with O(V) marks) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference == https://link.springer.com/article/10.1007/BF00268499")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V+E)$

Space Complexity

$O(V)$ auxiliary? words

(maintain O(V)-sized recursion stack, along with O(V) marks)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1976

Reference

https://link.springer.com/article/10.1007/BF00268499

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Tarjan%27s_DFS_based_algorithm_(Topological_Sorting_Topological_Sorting)&oldid=45386"