8.3
Revision as of 14:06, 21 September 2020 by Algowikiadmin (talk | contribs) (Created page with "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...")
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.
Back to Chapter 8
