Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
In Actionscript, I’m trying to work out the best way to create the shortest route between two point on the map above. I have all the distances.
Algorithms like A* I dont think are relevant as it is near impossible to work out the heuristic distance.
I thought I could create a big array of all the nodes with the distances to any connected nodes and just iterate through until Ive found the the shortest distance, but this I know is very inefficient.
I think you are looking for this algorithm:
http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm