ConceptTheory & Algos
Topological order
A linear ordering of vertices in a directed acyclic graph such that for every directed edge from u to v, u comes before v in the ordering.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Erik Demaine
Connections
3The lectures that define it or assume it, and the concepts next to it.