Can a graph have multiple distinct minimum spanning trees?

442 Views Asked by At

I have the following undirected graph which has multiple edges that have the same edge weights, the question is it possible to find more than one distinct minimum spanning tree for the following graph?

Undirected graph

1

There are 1 best solutions below

0
On

Yes, for this graph you can construct two MST with the same weight 9 (they differ in the last edge):

  • (B-C), (C-D), (D-E), (E-F), (A-F);
  • (B-C), (C-D), (D-E), (E-F), (A-B).