usaco-guide/content/5_Gold/TopoSort.md

id	title	author	prerequisites
toposort	Topological Sort	Benjamin Qi	Gold - Breadth First Search

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

• CSES Course Schedule
• CSES Longest Flight Route
• CSES Game Routes

Tutorial

• CPH 16.1, 16.2
  • DFS
• cp-algorithms
  • DFS
• CSAcademy
  • both BFS, DFS

Problems

• USACO Gold
  • Timeline
  • Milking Order
• Other
  • Minimal Labels
  • Quantum