演算法›Ch4 圖論演算法第 53 題／共 111 題
53. Minimum Spanning Tree、TSP
#AL-04-053易Minimum Spanning TreeTSP
- (2%). Let G = (V, E) be a complete graph with edge length function w. Prove or disprove the statement: The cost of any minimum spanning tree (MST) for (G, w) is always no more than the cost of any TSP tour for (G, w).
📄 交大112
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法