Graph Theory37 sections · 1633 units
Open in CourseQuiz: 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 nodes chosen are and . What does the cut vs everything else represent?
- A.The global minimum cut of the graph
- B.The shortest path weight from to
- C.The maximum spanning tree weight
- D.A minimum - cut in the current contracted graph