Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
What is a bridge in an undirected graph, and how is it found?
A
The heaviest edge
B
An edge between two leaves
C
An edge in every cycle
D
An edge whose removal disconnects the graph; found with DFS discovery times and low-link values in O(V + E)