Demian* 
Oh Lordy, Plegaleggole 
Thu 23rd Oct '08 2:34PM 
4678 Posts 

Member Since 
7th Apr '03 

After spending hours trying to wrap my head around mathematics I don't understand, I once again turn to thedaddy.org for help!
From what I've read the most efficient way to do this is with the A* algorithm. However, this is far too complex for little old me to understand. A bit of further searching led me to Dijkstra's algorithm which can, at least, be stated in english. There are also 'breadth first' and 'depth first' algorithms but I'm not sure if these are simply for traversing tree structures. Other possibilites may be the FloydWarshall Algorithm or Johnson's Algorithm, or Hill Climbing  but I'm not sure that does exactly what I want.
What I'm looking for is not the most efficient way to do this, but the simplest. The selected route, however, must be the shortest. Does anyone have any experience in such matters?
Bidirectional pathfinding seems useful, but looks to be a way to use another algorithm twice, once from the start and once from the end, and stopping when the two meet  so I'd still need to pick an algorithm to implement bidirectionally.
Edit: Route, not distance. Doh!


