Programming, Data Structures, Algorithms, Computer Science, Tech.
to do is mark node e as visited. Now, we’re actually completely done with running Dijkstra’s algorithm on this graph! We’ve crossed out a lot of information along the way as we updated and changed the values in our table. Let’s take a look at a nicer, cleaner version of this table, with only the