Planjure: A* and Dijkstra's in Om

I read this as A* and Dijkstra's in O(m) and was expecting something very different.

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&seqNu...

Looks cool. I've always liked the detailed introduction to A* and comparison to other methods: http://www.redblobgames.com/pathfinding/a-star/introduction....