# TADM2E 6.3

From Algorithm Wiki

Revision as of 16:39, 30 October 2015 by Andrewmkeller (Talk | contribs)

No. Counter example provided below:

G(V,E,W) = ((A,B,C,D),({A,B},{B,C},{C,D},{D,A}),(1,2,3,4))

Minimum spanning tree has a weight of 6 with edges {A,B},{B,C},{C,D}.

In the full graph the minimum distance between A and D is 4.