5 ms·
Planjure: A* and Dijkstra's in Om
- deleted 12y ago[deleted]
- nobullet 12y agoLooks cool. I've always liked the detailed introduction to A* and comparison to other methods: http://www.redblobgames.com/pathfinding/a-star/introduction.html http://www.redblobgames.com/pathfinding/a-star/introduction....
- Rhapso 12y agoI read this as A* and Dijkstra's in O(m) and was expecting something very different.
- peterfirefly 12y agoI thought Om was a little-known language, possible something new and homebrewed.
- vilda 12y agoDijkstra'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...
- elbenshira 12y agoA "map" is a graph.