Tarjan's DFS based algorithm (Topological Sorting Topological Sorting): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 363 bytes +363‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Tarjan%27s_DFS_based_algorithm_(Topological_Sorting_Topological_Sorting)"