[问答题]
A baker, starting a business baking bread and
*. r3,rjwcdvi muf
a+ m)1t79 o u;tidfdlbfins, plans to visit 5 nearby cafes (A-E) to enqui
)il9t;+ 17d ubdm ftaore if they want to stock her goods in their cafes. The distances between the cafes, in km, are shown in the following weighted adjacency table.
1.Draw a possible graph for this weighted adjacency table.
2.Starting from cafe C, use the nearest-neighbour algorithm to determine an upper bound to the travelling salesman problem for this graph.
3.By removing cafe E, use the method of vertex deletion to determine a lower bound to the travelling salesman problem for this graph.
