CSCI2100 · Theorem · Chapter 13 · Graph traversal
Parenthesis property
2 steps of prerequisites below it
For distinct vertices the DFS intervals [d[u], f[u]] and [d[v], f[v]] are disjoint or nested, and v is a descendant of u exactly when d[u] < d[v] < f[v] < f[u].
Taught in
- 13.2 Graph representations and depth-first search · introduced
Uses
- Depth-first search · used in its definition, passage 13.2
Used by
No later knowledge point in these notes uses it.
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.