Description: Using adjacency table records the ID stored villages and villages between the two weights. Using breadth search, use Deng Junhui teacher template BFS. Take any point before the search to its farthest point (with weights) i, i must be the point on the critical path of a farthest point. Then search for the starting point of a point farthest away from him (with weights), the resulting path must be donfood is farthest.
To Search:
File list (Check if you may need any files):
TSP.cpp
Download