Programming, Data Structures, Algorithms, Computer Science, Tech.
information as this algorithm runs. Dijkstra’s algorithm, part 1 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