1.1 KiB
1.1 KiB
slug | title | author | order | prerequisites | ||
---|---|---|---|---|---|---|
/gold/toposort | Topological Sort | Benjamin Qi | 3 |
|
A topological sort of a directed graph is a linear ordering of its vertices such that for every directed edge u\to v
from vertex u
to vertex v
, u
comes before v
in the ordering.
Example Problems
Tutorial
- CPH 16.1, 16.2
- DFS
- cp-algorithms
- DFS
- CSAcademy
- both BFS, DFS
Problems
- USACO Gold
- Other