Question: What would the cost array contain immediately after Dijkstra's algorithm discovers with certainty the least-cost path from A to C but just before this path

What would the cost array contain immediately after Dijkstra's algorithm discovers with certainty the least-cost path from A to C but just before this path is used to update the cost estimates of C's neighbors in the graph shown below
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
