0

Possible Duplicate:
How can I use the A star algorithm to find the first 100 shortest paths?

How to modify the A* algorithm in order to find the first k(let's say 50) shortest paths ? I need to develop it as a C++ application. Please explain. Thanks a lot friends...

Community
  • 1
  • 1
SPKan
  • 555
  • 2
  • 12
  • 26
  • What do you want to do with them? An n-th shortest path is usually the shortest path with a detour somewhere and generally useless for any practical purpose. – Jan Hudec Jan 02 '13 at 10:17
  • A* algorithm find the first shortest paths automatically.what is your problem exactly ? – amin k Jan 02 '13 at 10:37

0 Answers0