Graph Theory37 sections · 1633 units
Open in Course

Quiz: Maximum Adjacency Ordering

Knowledge check

Check Your Understanding

In maximum adjacency ordering, you repeatedly select the node most tightly connected to the already-chosen set. The last 22 nodes chosen are ss and tt. What does the cut {t}\{t\} vs everything else represent?

  1. A.The global minimum cut of the graph
  2. B.The shortest path weight from ss to tt
  3. C.The maximum spanning tree weight
  4. D.A minimum ss-tt cut in the current contracted graph
Start the roadmap to answer the quizzes and solve the challenges