code modification for saving shortest path
Part 1: ASSIGNMENT: Note 1 tells us that this code determines the shortest path to every other vertex. It does not specifically keep track of the vertices in the shortest path to our target vertex.
The code calculates shortest distance, but doesnâ€™t calculate the path information. We can create a
parent array, update the parent array when distance is updated (like primâ€™s implementation) and use it
show the shortest path from source to different vertices.
Part 2;ASSIGNMENT: Note 3 suggests a change to this code that would stop execution of this program when the shortest distance to our target vertex is reached. Copy and paste (WITH YOUR MODIFICATIONS) the section of code suggested in this note.
The code finds shortest distances from source to all vertices. If we are interested only in shortest
distance from the source to a single target, we can break the for the loop when the picked minimum
distance vertex is equal to target (Step 3.a of the algorithm).