Kahn's algorithm (Topological Sorting Topological Sorting)

From Algorithm Wiki

Revision as of 09:42, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(V+E)$

Space Complexity

$O(V)$ words

(maintain stack of nodes with no incoming edges)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1962

Reference

https://dl.acm.org/doi/10.1145/368996.369025

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