Tarjan's strongly connected components algorithm (SCCs Strongly Connected Components): 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.

    15 February 2023

    • curprev 10:3710:37, 15 February 2023‎ Admin talk contribs‎ 441 bytes +441‎ Created page with "== Time Complexity == $O(V+E)$ == Space Complexity == $O(V)$ words (https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0020019015001532) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1972 == Reference == https://www.semanticscholar.org/paper/Depth-First-Search-and-Linear-Graph-Algorithms-Tarjan/385742fffcf113656f0d3cf6c06ef95cb8439dc6"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Tarjan%27s_strongly_connected_components_algorithm_(SCCs_Strongly_Connected_Components)"