Shortest Path on Data Structure and Algorithms related Questions and Answers

Question :    Complete the program. n=rows[W]D(0)=Wfor k=1 to n do for i=1 to n do for j=1 to n do ________________________________return D(n) 1. dij(k)=min(dij(k-1), dik(k-1) – dkj(k-1)) 2. dij(k)=max(dij(k-1), dik(k-1) – dkj(k-1)) 3. dij(k)=min(dij(k-1), dik(k-1) + dkj(k-1)) 4. dij(k)=max(dij(k-1), dik(k-1) + dkj(k-1)) 5. Answer :   3 - dij(k)=min(dij(k-1), dik(k-1) + dkj(k-1))