Can Floyds algorithm for the Shortest Paths problem 2 (Algorithm 3.4) be modified to give just the shortest path from a given vertex to another specified vertex in a graph? Justify your answer.

Algorithm 3.4 Floyd's Algorithm for Shortest Paths 2 Problem: Same as in Algorithm 3.3, except shortest paths are also created. Additional outputs: an array P, which has both its rows and columns indexed from 1 to n, where highest index of an intermediate vertex on the shortest path from vi to ui, if at least one intermediate vertex exists. 0, if no intermediate vertex exists. Plij] = void floyd2 (int n const number Wl DiII number index PO) index, i, j, k; for (i= 1; i