Blog

First, a bit of dry theory about pathfinding.

One of the shortest-path algorithms is the Dijkstra algorithm. It is used to find the shortest path in a graph from a starting point to all other points, or the shortest path to one specific destination.

This is how it works on a graph:

• the dista...