Finding The Shortest Path, With A Little Help From Dijkstra

These instructions are our golden rules that we will always follow, until our algorithm is done running. So, let's get to it! First things first: we need to initialize some things to keep track of some important information as this algorithm runs. We'll create a table to keep track of the shortest known distance to every vertex in our graph. We'll also keep track of the previous vertex that we came from, before we "checked" the vertex that we're looking at currently. Once we have our table all set up, we'll need to give it some values.