Graph Theory37 sections · 1633 units
Open in Course

Quiz: Bipartite Matching via Flow

Knowledge check

Check Your Understanding

You model bipartite matching as a flow network: source connects to all left nodes, sink connects to all right nodes. What capacity do you assign each edge?

  1. A.11 for source/sink edges, infinity for matching edges
  2. B.11 for all edges
  3. C.Infinity for source/sink edges, 11 for matching edges
  4. D.nn for source/sink edges, 11 for matching edges
Start the roadmap to answer the quizzes and solve the challenges