One Edge Rejected

Kruskal on 6 nodes, A through F. Edges already sorted by weight:

edge A-B C-D A-C E-F B-C D-E C-E D-F
weight 1 2 3 3 4 5 6 7

The loop stops as soon as the forest has V - 1 = 5 edges. What is the total weight, and how many edges does Kruskal reject along the way?

A

Weight 15, no edge rejected

B

Weight 14, exactly one edge rejected

C

Weight 13, exactly one edge rejected

D

Weight 14, three edges rejected