Agent Engineering
Topological Sort
An ordering of every node in a directed acyclic graph that places each prerequisite before the nodes depending on it. Several valid orders may exist when tasks are independent. A topological order describes permissible precedence, not a duration estimate, an optimal schedule, or a promise that a task has actually finished.
Also called: Topological ordering
Reviewed
Sources
Member lesson
The definition and sources are public. The complete practical lesson is for members.