Design and Analysis of Algorithms

Assignment 8: Write a program to solve the travelling salesman problem. Print the path and the cost. (Branch and Bound).

Assignments 7: Write a non-recursive program to check whether Hamiltonian path exists in undirected graph or not. If exists print it. (backtracking).