Shortest path algorithm explained

Some might be like me struggling with this algorithm whenever it’s needed in a contest, gamedev newsletter gave a link to what is supposed to be a very simple explanation of the elusive Dijkstra algorithm. Hope it helps:


Thanks, pretty useful!

Really well explained !
Maybe a good next step would be this :

It focuses on the implementation of BFS, Dijkstra and A* in Python, C++ and C#

This is a good starting point for someone who understands things better with practice than with theory