MENTAL MODEL · M9920

Topological Sort

BusinessHigh supportManagement

Included

Version 1.0.0 · Updated 2026-07-30

CORE DEFINITION

Sorting the vertices of a directed acyclic graph so that the start of every edge comes before its end—that is, ordering tasks according to dependencies.

SCAFFOLDING EFFECT

psychology

Reduce cognitive load

Clarify the order of precedence. Identify which tasks must be completed before starting the next.

anchor

Anchor fast decisions

Topological sort arranges the nodes of a directed acyclic graph (DAG) into a linear order such that every edge points from earlier to later, expressing precedence dependencies. It is the foundation for scheduling tasks with dependencies.

MINIMUM ACTION

In progress 0/1

Practice this model in one real situation:

For a DAG, use Kahn's algorithm (queue of nodes with in-degree 0) or DFS postorder to obtain a topological order. If a cycle exists, report that sorting is impossible.

Check to track your progress (stored locally)

Learning progress0%

account_treeGenealogyexpand_more

menu_bookReferencesexpand_more

Source support: Explicit

link
en.wikipedia.orghttps://en.wikipedia.org/wiki/Topological_sortingZH · Explicit
verified

RELATED MODELS