For the two complete graphs shown, find the costs of the nearest-neighbor tour starting at B...

 

Transcribed Image Text:

For the two complete graphs shown, find the costs of the nearest-neighbor tour starting at B and of the tour generated by the sorted-edges algorithm. Give your answers as whole numbers. graph (a): nearest-neighbor: graph (a): sorted-edges: graph (b): nearest-neighbor: graph (b): sorted-edges: IT 11 TOOLS E 11 L 38 59 28 50 71 E 56 65- 39 18 (a) 73 31 54 60 71 (b) 69 286 47 42 38 43 F8 D B 62 43 62 47 D U For the two complete graphs shown, find the costs of the nearest-neighbor tour starting at B and of the tour generated by the sorted-edges algorithm. Give your answers as whole numbers. graph (a): nearest-neighbor: graph (a): sorted-edges: graph (b): nearest-neighbor: graph (b): sorted-edges: IT 11 TOOLS E 11 L 38 59 28 50 71 E 56 65- 39 18 (a) 73 31 54 60 71 (b) 69 286 47 42 38 43 F8 D B 62 43 62 47 D U

Answer rating: 100% (QA)

A Nearest neighbour algorithm A 18 B E F 38 A 18 B 71 CD AD And the route is B Sorted edges algor... View the full answer