Topological Sort of a Directed Acyclic Graph

From NovaOrdis Knowledge Base
Revision as of 19:13, 30 September 2021 by Ovidiu (talk | contribs) (→‎Overview)
Jump to navigation Jump to search

External

Internal

Overview

This is a very useful algorithm when a set of tasks that have precedence constraints between them need to be sequenced - executed in order. The topological sort can be done using Depth-First Search (DFS).