This problem teaches you Tarjan's articulation point algorithm, which extends the bridge algorithm to vertices. core concept: a vertex is critical if its removal disconnects its subtree from the rest of the graph. Check the root case (multiple children) and non-root case (low[v] >= disc[u]).
This algorithm is used in network design to identify critical servers or routers. Protecting articulation points improves network resilience.