In a network, a bridge is a link whose failure disconnects part of the graph, and an articulation point is a node whose failure does. Tarjan's algorithm finds both in one DFS using low-link values: low[v] is the earliest discovery time reachable from v's subtree using at most one back edge.
Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.
Start 7-day free trial