What is topological sort? Where is it used (build systems, tasks)?

Topological sort

Linear ordering of DAG where every edge u→v has u before v. Kahn's (BFS indegree) or DFS postorder.

• Build systems task dependencies
• Course prerequisite scheduling
• Detect cycle if not all nodes processed

// Kahn: queue nodes with indegree 0, reduce neighbor indegree