Find all critical connections in a network

I approached the problem by implementing a depth-first search (DFS) algorithm to find critical connections in a network represented as a graph. The goal was to identify edges that, when removed, would increase the number of connected components in the graph. I started by outlining the Tarjan's algorithm approach, ensuring the identification of articulation points, and I discussed how I would maintain discovery and low-link values during traversal. The interviewer seemed engaged initially but pointed out some inefficiencies in my recursive approach for large graphs, prompting me to consider iterative solutions.