# Critical Connections In A Network: Study Guide
Critical Connections In A Network shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Tarjan: track discovery time and low-link; a bridge is an edge u-v where low[v] > disc[u].
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS/DFS, union-find, topological sort, or tree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(V+E).
## Common mistake
Using low[v] >= disc[u] (that is an articulation point test, not a bridge).
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI coding interview assistant.