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 ...

what the full pack contains before buying anything. Each sheet is built on its own weighted network. Question 1 is the trace table, one row per vertex settled, with tentative distances and the vertex ...