Answer Happy

IV. Dijkstra's algorithm Considering the following directed graph, we want to use Dijkstra's algorithm to determine the shortest path from vertex 1 to each of the other vertices. Update the entries in the following table to indicate the current shortest known distance and predecessor vertex on the path from vertex 1 to each vertex as the algorithm progresses. (Cross out old entries when you add new ones.) The initial values for the distances are given for you. Below the table, list the vertices in the order that they are added to the cloud" of known vertices as the algorithm is executed 5 2 6 (a) Distance from vertex 1 Predecessor vertex Vertex 1 2 3 4 5 6