# 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 DFS: a tree edge u-v is a bridge when low[v] > disc[u], meaning v cannot reach u or its ancestors any other way.
## 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, Dijkstra, Union-Find, or interval 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
Reporting every edge that is a tree edge in one DFS, which includes non-bridges that have back edges deeper in the subtree.
## 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 official website.