Tarjan's DFS based algorithm (Topological Sorting Topological Sorting): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(V)$ | $O(V)$? words | ||
(maintain O(V)-sized recursion stack, along with O(V) marks) | (maintain O(V)-sized recursion stack, along with O(V) marks) | ||
Latest revision as of 09:42, 10 April 2023
Time Complexity
$O(V+E)$
Space Complexity
$O(V)$? 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