Kahn's algorithm¶
Kahn, A. B. (1962). Kahn's algorithm.
Retired. This entry was not a citation. Our extractor stored an inline prose definition from the article as though it were a bibliographic record: the title names a concept rather than a published work, and the citation text names no work at all. The page is kept because links to it still resolve, but it is withdrawn from the reference list. This entry is kept so the citations that pointed at it still resolve, and so the correction is visible rather than silent.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Topological Sorting
- In Kahn's algorithm, you find any element with no unmet dependency, output it, remove it and its outgoing edges, and repeat; if elements remain but none is free, a cycle exists.
This sourceIt requires a directed acyclic graph (DAG) — the moment the structure has a cycle, no topological order exists.
- In Kahn's algorithm, you find any element with no unmet dependency, output it, remove it and its outgoing edges, and repeat; if elements remain but none is free, a cycle exists.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:51ddc883a3b0 · see in the full table