In my previous post, I described how Dijkstra’s algorithm allows us to make our way through mazes, maps, and other graphs, finding the shortest path between a start and end point.

To illustrate what a code implementation might look like, I will use a challenge from my favourite coding event, Advent of Code.

You wake up from a crazy evening at a Data Science conference in the middle of a cornfield maze. You look to your left, and see corn. To your right, corn. You have no idea how you got here, nor how to get back to civilisation in time for the rest of the conference!