Couple of spreadsheets to aid teaching of Dijkstra's shortest path algorithm and A* algorithm. Example and step by step explanation included. Tried to make it as self explanatory as possible so can be ...

The A* algorithm aims to find a path from a single start to a single destination node. The algorithm cleverly exploits the single destination by computing an estimate how far you still have to go. By ...