Bridges
One DFS with discovery times and low-links; a tree edge u-v is a bridge when low[v] > disc[u].
Decision · step 5 of 19Bridges and Components: Two triangles and a pendant
Edge 2-0 leads to a vertex seen at time 0, an ancestor on the current path. That is earlier than low[2] = 2, so low[2] becomes 0: 2 can climb to 0.
What you will see
Low-link values propagate back up the DFS tree; edges whose removal would disconnect glow.
Cost
| Best | O(V + E) |
|---|---|
| Average | O(V + E) |
| Worst | O(V + E) |
| Space | O(V) |
How you work with it here
play it through, step one change at a time, scrub to any step, run it on your own input, predict what happens next.
Screen readers: Vertices announce name, discovery numbers where relevant and component; each step announces the structural conclusion (bridge found, component closed).
Reduced motion: Component colouring and ordering changes crossfade in place.
Before this
Related
Taught by the same lesson
Bridges and Components covers these too, in the same run.