Graph Theory37 sections · 1633 units
Open in Course

Quiz: Unique MST with Unique Weights

Knowledge check

Check Your Understanding

If all edge weights in a graph are unique, the MST is unique. True or false?

  1. A.True. Each greedy choice is forced because there are no ties.
  2. B.False. There can still be multiple MSTs with unique weights.
  3. C.True, but only if the graph is connected.
  4. D.False. Unique weights only guarantee a unique shortest path tree.
Start the roadmap to answer the quizzes and solve the challenges