Dijkstra's algorithm finds the shortest path in any graph. My guess is that its simplicity and universality is why it's being commonly "misused" on maps, where

Dijkstra's algorithm finds the shortest path in any graph. My guess is that its simplicity and universality is why it's being commonly "misused" on maps, where the "graph" is intrinsic. Even such a simple rule as the triangle inequality, if it holds, improves Dijkstra's considerably[0]. [0] http://www.informit.com/articles/article.aspx?p=169575&seqNum=6 http://www.informit.com/articles/article.aspx?p=169575&seqNu...