Topological Sort

Definitions

1. An ordering of a directed acyclic graph's vertices such that every edge goes from earlier to later in the ordering. Used by build systems (compile dependencies before dependents), package managers (install in order), task schedulers (run prerequisites first), and database migrations (apply in order). Only possible if the graph has no cycles.

   In plain English: Putting tasks in order so that everything a task depends on is done before the task itself — like a build order.

   Example: "The build system topologically sorts the modules — it compiles the utils library before the auth module that depends on it."

Related Terms

• Cabal
• Cargo
• Compiler
• Cross-Compilation
• Data Structure
• Linker
• Preprocessor
• Dijkstra's Algorithm
• Two Pointers