Maybe posting this question here is wrong, if so I'm sorry and please close this topic.

I was wondering which shortest path algorithm is used by Google Maps to find the minimal route between two points

Does anyone know anything about that?

  • 1
    $\begingroup$ It's probably a corporate secret. Knowing who is in the team might help. $\endgroup$ – Emre Oct 25 '11 at 18:58
  • 3
    $\begingroup$ I doubt that it is a correct-working algorithm, sometimes forcing it to use a different way slightly decreases the distance (even if you choose to walk). So I guess they use some really good heuristics. $\endgroup$ – Listing Oct 25 '11 at 19:28
  • $\begingroup$ @Paul May be somebody at gis.stackexchange.com could say something about it. $\endgroup$ – Andrew Oct 26 '11 at 6:31

As Emre says, it's probably a corporate secret, but I would guess that they've just optimized the heck out of some well-known algorithm. You can find info about such algorithms by starting here.

| cite | improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.