Graph Theory37 sections · 1633 units
Open in Course

Quiz: Finding Cut Edges

Knowledge check

Check Your Understanding

After computing max flow, you run BFS from ss in the residual graph. Node uu is reachable but vv is not. Edge (u,v)(u, v) has capacity 66 in the original graph. How much flow does this edge carry?

  1. A.00
  2. B.33
  3. C.66
  4. D.Cannot determine from this information
Start the roadmap to answer the quizzes and solve the challenges