FOR J:=1 TO n DOIF afi.k a[kj)<aldijl THENBEGINa[ijl:=a[i,k] a[,jl:FORU:=I TONDOpath[i.u]:=pathiku]path[k ju]ENDFORIAITONDOFOR j:=1 TO n DOFORU:=I TONDOI pathli ju] THENBEGINwrite( The shortest length from,i, "to, j, is',a i,JD):writcln(path[ij)ENDELSE writeln("The shortest length from ,i, to j, isnot existing!')END