Expert: Narendra - 9/3/2006

Question
Hi there!

Im stuck with a program that i have to write in c.
Its the Famous Traveling Salesman problem, better known as the Hamilton circuit.

There are 5 cities.
It is an undirected graph ( distance from A to B is equal to dist form B to A)

The salesman has to visit all the 5 cities only once. I have to help him find the shortest route.

I thought of sloving through bruteforce, that is i try all combinations and the shortest one is the solution...
Confused dont know how to go about it. Graphs! Phew

SOS
Thanking you in advance Sean

Answer
Where is your program and where you are stuck?
First of all, have you understood the concept of the underlying problem?

If yes, have you written down (in plain English) the steps needed to solve this?
You can proceed to coding, only after you complete the above steps. Otherwise, you will not be able to get your program working.