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

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

[问答题]
The weights of the elli 0cla;lxu:8b j( )idges in th j6oct4yl.uo0 e complete graph $boldsymbol{G}$are given in the following table.


1. Starting at vertex A, use the nearest-neighbour algorithm to find an upper bound for the travelling salesman problem for graph $\boldsymbol{G}$.
2. By first deleting vertex A, use the deleted vertex algorithm together with Kruskal's algorithm to find a lower bound for the travelling salesman problem for $boldsymbol{G}$ .

参考答案:

本题详细解析: 暂无

微信扫一扫，分享更方便