CSCI2100 · Theorem · Chapter 13 · Graph traversal
Cycles and back arcs
3 steps of prerequisites below it
A finite directed graph contains a directed cycle if and only if a depth-first search of it finds a back arc.
Taught in
- 13.2 Graph representations and depth-first search · introduced
Uses
- Edge classification · used in its proof, proof step 13.2
Used by
Counterexamples
Everything this builds on, earliest first · 3 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
- Edge classification · 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.