TSP problem statemet : Given n cities find the shortest tour that passes through each of the cities exactly once.

This is not a shortest path problem.

-Dhyanesh


On 12/15/05, HalFas` <[EMAIL PROTECTED]> wrote:
you can find some info about path finding in theese links:
http://theory.stanford.edu/~amitp/GameProgramming/
http://www.gameai.com/pathfinding.html
http://www.redbrick.dcu.ie/~hazy/networks/dijkstra.html
http://www.eas.asu.edu/trace/eee459/sriram.html



On 12/16/05, ridvansg <[EMAIL PROTECTED]> wrote:
>
> HalFas I am interested give some more info about this point based
> algorithem
>
>


--
---- Lukas Ĺ alkaukas ----

Reply via email to