Topological Sort of a Directed Acyclic Graph: Difference between revisions
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
=Overview= | =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. | 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). | ||
Revision as of 19:12, 30 September 2021
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).