If you can read this, you have JavaScript turned off.
Please turn it on for optimal browsing experience.
This short video shows how Dijkstra's algorithm calculates cells on a 2d grid, starting from the source cell and going outwards according to the allowed moves and their cost, or weight. The final part shows a neat example of how Dijkstra's algorithm can be used to create rivers.