FOR j:=1 TO n DOI ali,k ak.<a, THENBEGINa[ijl:=a[i,k] [k,l;FORU:=1 Tondopathlij. u]:=path[i,k,u]path[k,j,FORIAITONDOFOR:=1 TO n DOFORU=I TONDOpathij.u] THENBEGINwrite( The shortest length from ,i, "to j, is',a i,j);writcln(path ij,u)ENDELSE writeln("The shortest length from' i, to J, isnot existing!'"END
发布时间:2025-07-25 20:57:24