4. For the graph below, find the shortest path from v3 to v6. Write (by hand) the values of the “allowed” and “distance” arrays at the end of each iteration of the outer loop for Dijkstra’s algorithm. Then write the vertices of the complete path in order. Note that you may check your answer using your program previous problem, but you will be expected to perform the algorithm by hand on the exam.
OR
OR