This problem teaches you Tarjan's bridge algorithm, which is the standard solution for finding critical edges in time. core concepts: use DFS to compute discovery times and low-link values. An edge is a bridge if the subtree beyond it cannot reach back to earlier vertices.
This algorithm generalizes to many network reliability problems where you need to identify single points of failure and add redundancy.