Solving the travelling salesman problem for upto 10 cities using an undirected complete graph represented as an adjacency matrix. Problem is solved using brute force and the nearest neighbour algorithm.
Done by
- Yash Mathur - 01FB15ECS357
- Vivek Kapoor - 01FB15ECS356
- Vishal Krishna - 01FB15ECS354
- Varun Vora - 01FB15ECS342