Graph Theory37 sections · 1633 units
Open in CourseQuiz: Bridge Detection Condition
Knowledge check
Check Your Understanding
In Tarjan's bridge algorithm, edge where is the DFS parent of is a bridge when which condition holds?
- A.
low[v] < disc[u] - B.
low[v] == disc[v] - C.
low[v] > disc[u] - D.
low[v] == disc[u]