Help! I am writing about: Travelling salesman problem
Hint: Given a list of cities and their pairwise distances, the task is to find the shortest possible route that visits each city exactly once and returns to the origin city
Can Anybody help me? Which algorithm is the best and how can I get the code? May God bless you.

i have done something like this before...what you may likely need do is get the co-ordinates of each city in (x,y) format e.g. Enugu(34,54), Lagos(53,34), Abuja(23,78) and so on from your map or graph(as the case may be)...to get the shortest distance between any of the two points you use square-root of [(x2-x1)²+(y2-y1)²]

Hope this helps..

Just google it, u will get the code, itz in c#. I have d code on my other system I could have sent it to u but itz not here with me. I got it online.