Which of the following statements correctly describes the traveling salesman problem?(1 point)
Responses
The traveling salesman problem finds the shortest path between two points in a graph.
The traveling salesman problem finds the shortest path between two points in a graph.
The traveling salesman algorithm has a lower time complexity than common sorts or searches.
The traveling salesman algorithm has a lower time complexity than common sorts or searches.
The traveling salesman algorithm is a classic algorithm.
The traveling salesman algorithm is a classic algorithm.
The traveling salesman algorithm has a lower space complexity than common sorts or searches.