Programming, Data Structures, Algorithms, Computer Science, Tech.
before, which we now know isn’t actually the shortest. No worries — we’ll just cross out the previous vertex for node b, and replace it with the vertex which, as we now know, has the shorter path: node c. Dijkstra’s algorithm, part 4 Alright, so now we’ve visited both node a and c. So, which node