TSP(Traveling Salesman Problem)MurkyPig·FollowPublished in翛然野叟·1 min read·Feb 18, 2019--ListenShareBacktracking or Dynamic programming經典例子,周遊各國的商人,想去所有不同的地方買賣東西,求最短路徑→判斷是否存在H.C.且 weight min (NP-hard)時間複雜度:Backtracking :O(v!) = O(n^n)Dynamic programming : O(2^n)