CSCI2100 · Definition · Chapter 13 · Graph traversal
Topological order
0 steps of prerequisites below it
A topological order of a directed graph lists its vertices so that for every arc u → v, u appears before v.
Taught in
- 13.2 Graph representations and depth-first search · introduced
Builds on
Nothing in the notes sits below this point: it is a starting point.
Used by
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Nothing is recorded below this point: it is a starting point.