The input to the problem is a collection of n points in the plane. The points have int values. The goal of the traveling salesperson problem is to find the shortest path that visits every point exactly once and returns to the starting point. That is, we are looking for a cycle in the graph that visits each vertex exactly once, such that the total length is as small as possible. Storing the points: You will need to write a class that stores a collection of points. You may use any data structure you want to do it (array, linked list or vector in C++) Print the list of points: Your solution should have a method that prints the list of all points. Your solution should have a method that draws the points on the screen. You will need to implement a heuristic algorithm that finds a solution to the TSP problem
IN C++
The input to the problem is a collection of n points in the plane. The points have int values.
The goal of the traveling salesperson problem is to find the shortest path that visits every point exactly once and returns to the starting point. That is, we are looking for a cycle in the graph that visits each vertex exactly once, such that the total length is as small as possible.
Storing the points:
You will need to write a class that stores a collection of points. You may use any data structure you want to do it (array, linked list or
Print the list of points:
Your solution should have a method that prints the list of all points.
Your solution should have a method that draws the points on the screen.
You will need to implement a heuristic
Step by step
Solved in 2 steps