Multiple choice

If all the edges in a graph are unique, then there is only one minimum spanning tree for the graph.

  1. Yes

  2. No

  3. Sometimes Yes, sometimes No

  4. Cannot comment
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

If all edge weights in a graph are unique, the greedy choice at each step of Kruskal's or Prim's algorithm is unambiguous, resulting in a unique MST.

Keep practicing — related questions