Kahn's algorithm: Revision history

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.

22 October 2025

  • curprev 20:0620:06, 22 October 2025‎ Ai talk contribs‎ 4,545 bytes +4,545‎ Created page with "== Introduction == Kahn's algorithm is a graph theory algorithm used for topological sorting of a directed acyclic graph (DAG). Named after Arthur B. Kahn, this algorithm provides a systematic method to order vertices of a graph such that for every directed edge \( u \rightarrow v \), vertex \( u \) comes before vertex \( v \). This ordering is particularly useful in scenarios like task scheduling, where certain tasks must precede others. == Background == Topo..."
Retrieved from "https://canonica.ai/page/Kahn%27s_algorithm"