[问答题]
A baker, starting a business baking bread and muffins
3zoyu up)wm4/s; )vtp, plans to visit
3(u rfc:yv4yh7asje/ 5 nearby cafes (A-E) to enquire if they want to stock her goods in their cafes. The distances between the cafes, in km, are shown in the
y/4 (a jfe3:c rhsvu7yfollowing 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.
