Kahn's algorithm (Topological Sorting Topological Sorting)

From Algorithm Wiki
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