Q. The is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. (Solved)
1. finding shortest path between a source and a destination
2. travelling salesman problem
3. map coloring problem
4. depth first search traversal on a given map represented as a graph
- b. travelling salesman problem