Let us change our traditional attitude to the construction of programs. Instead of imagining that our main task is to instruct a computer what to to, let us concentrate rather on explaining to human beings what we want a computer to do. Donald Knuth

Finding the best path for a travelling salesman

Language Java | Level Intermediate | Category Algorithms | August 5, 2015 8:32 am


Algorithm Problem Description

Travelling salesman problem helps to find the shortest possible route that visits each city exactly once and returns to the origin city. The travelling salesman problem solves the given set of cities and distance between each pair of cities. Find the shortest route that visit each city exactly once and return to the origin of the city.

Write a program to give all the brute force approach to find the sorted path between the cities?

Output

          	        
          	        

Number of items from the list: [0, 1, 2]
All the routes using Branch and bound : 
[0, 1, 2]
[0, 2, 1]
[1, 2, 0]
[1, 0, 2]
[2, 0, 1]
[2, 1, 0]

          	        
          	        				    


Comments



Please login to add comments.