Why it matters

Bridges identify critical connections. Complement to articulation points.

Advertisement

The architecture

DFS + disc + low.

Edge (u, v) is bridge if low[v] > disc[u].

Bridges via lowlinkDFS tree edgesback edges tooCompute lowfor each vertexBridge iflow[v] > disc[u]Similar structure to articulation points; different condition
Bridges.
Advertisement

How it works end to end

Compute disc + low.

For each tree edge (u,v), check low[v] > disc[u].

Back edges never bridges.