5.7.2 Floyd Algorithm.

INPUT: The Adjoining Array C (Boolean Array), nXn.
OUTPUT: The m.r. array , A ,nXn,with A(i,j)=cost of m.r. from V(i) to V(j).

(*initialisation *)

• for j:=1 to n do
  • for i:=1 to n do
    • A(i,j):=C(i,j)
  • end i-loop
• end j-loop

(*pass for every node *)

• for k:=1 to n do
  • for j:=1 to n do
    • for i:=1 to n do
      • s:=A(i,k)+ A(k,j)
      • if s<A(i,j) then A(i,j):=s
    • end i-loop
  • end j-loop
• end k-loop

HTML PAGE DIRECTOR :Papaioannou Panagiotis