IB MAI HL Geometry & Trigonometry Topic 3.7 Graph Theory (id: ad0296f69)

本题目来源于试卷: IB MAI HL Geometry & Trigonometry Topic 3.7 Graph Theory，类别为 IB数学

[问答题]
A baker, starting a bu- omxluh+gqu m :;(xl3siness ba *.7eo0zlbjjms0 af.wking bread and muffins, plans to visit 5 nearby cafes0ozwjbel.*0j. a s7m f (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 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.

参考答案:

本题详细解析: 暂无

微信扫一扫，分享更方便