Data Structures and Algorithms · Graphs

Topological sort

Ordering the vertices of a directed acyclic graph so every edge points forward.

Also known as: topo sort, DAG ordering, Kahn's algorithm.

Start a lesson on Topological sort

Learn first

• Graph traversal (BFS and DFS): Visiting every reachable vertex, either level by level (BFS) or by diving deep first (DFS).

Related topics

• Union-find: A structure that tracks which elements belong to the same group and merges groups quickly.