Programming, Data Structures, Algorithms, Computer Science, Tech.
cost to get to node c: in this case, 3. Finally, if the calculated distance is less than our currently-known shortest distance for these neighboring nodes, we’ll update our tables values with our new “shortest distance”. Well, currently, our table says that the shortest distance from a to b is ∞,