Example: Consider that a salesman needs to visit $5$ cities: $A,B,C,D,$ and $E.$ The distance between cities

are as follows.

The problem is to answer the following question. Find a path with least distance $($a$.$k$.$a$.,$ least cost path

or shortest path$)$ that the salesman starts at city $A,$ travels each city exactly once, and ends at city $A.$

Represent the problem as a graph. Show the search space.

This problem is known as travelling salesman problem.