5.7.2 Warshall Algorithm.

INPUT: The Adjoining Array C (Boolean Array), nXn.
OUTPUT: The transitive closure(boolean array,the A array),nXn.

(*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
      • if A(i,j):=false then A(i,j):=[A(i,k) AND A(k,j)]
    • end i-loop
  • end j-loop
• end k-loop

HTML PAGE DIRECTOR :Papaioannou Panagiotis