Graph AlgorithmsTopological Sort (Kahn's)
Topological Sort (Kahn's)
Orders the vertices of a DAG so every edge points forward, by repeatedly removing in-degree-zero nodes.
IntermediateDAGorderingin-degreedependencies
Loading visualization…
Orders the vertices of a DAG so every edge points forward, by repeatedly removing in-degree-zero nodes.