Apply the graph like in [login to view URL] file. Use the full (all-edged possible) weight graph where vertices are points in the plane, weights -
distances between vertices. Generate the specified number of points-vertices. Realize approximate heuristic The Traveling Salesman Problem (TSP) algorithm and print the path found and the distance found. Heuristic-
- Find a cycle through all the vertices in a greedy algorithm and make it easier to make interchanges between connections
so that the path after substitution is reduced. Try how long it is worth looking for such interchangeable edges.
Compare the weight of the received road with the weight obtained without using the road lightening.