CSCI2100 · Definition · Chapter 13 · Graph traversal
Edge classification
2 steps of prerequisites below it
When DFS examines u → v, the arc is a tree arc if v is white, a back arc if v is gray, a forward arc if v is black with d[u] < d[v], and a cross arc if v is black with d[v] < d[u].
Taught in
- 13.2 Graph representations and depth-first search · introduced
Builds on
- Depth-first search · used in its definition, passage 13.2
Used by
Everything this builds on, earliest first · 2 steps
Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.
- Adjacency matrix and adjacency lists · 13.2
- Depth-first search · 13.2
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
Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.