Graph Theory37 sections · 1633 units
Open in Course

Quiz: Bridge Detection Condition

Knowledge check

Check Your Understanding

In Tarjan's bridge algorithm, edge (u,v)(u, v) where uu is the DFS parent of vv is a bridge when which condition holds?

  1. A.low[v] < disc[u]
  2. B.low[v] == disc[v]
  3. C.low[v] > disc[u]
  4. D.low[v] == disc[u]
Start the roadmap to answer the quizzes and solve the challenges