Difference between pages "1.31" and "8.3"
(Difference between pages)
Jump to navigation
Jump to search
(Created page with "Back to Chapter 1.") |
(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...") |
||
| Line 1: | Line 1: | ||
| − | Back to [[Chapter | + | 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]] | ||
Latest revision as of 14:06, 21 September 2020
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
