Date Completed: February 2018
University Year 1 Term 2
Dijkstra's pathfinding algorithm is an algorithm for finding the shortest paths between nodes in a graph. The bottom image is an example of how my implementation works. Firstly, a 'map' with impassable obstacles (#) is created, a start point and end goal (H) is defined, and then the program must determine the least number of steps required to reach the end goal, whilst circumnavigating its envrionment.