You learned how to find bridges and articulation points using Tarjan's algorithm in time. Bridges are critical edges whose removal disconnects the graph. Articulation points are critical vertices whose removal disconnects the graph.
Both use DFS with discovery times and low-link values. You solved and learned applications in network reliability, graph partitioning, and circuit design.