Quiz: Bridge Condition

Critical Connections: Find all bridges (edges whose removal disconnects the graph). Edge $(u, v)$ is a bridge if and only if:

1. A.$u$ and $v$ are leaves
2. B.$u$ and $v$ have the same degree
3. C.The edge has the maximum weight
4. D.There's no back edge from $v$'s subtree to $u$ or $u$'s ancestors