Change in pseudocode
Change in pseudocode

We don't need to print Φ(i,j) as that is taken care of by PRINT-ALL-PAIRS-SHORTEST-PATH(Φ , Φ(i,j) , j). I am assuming initially for all edges (i,j) ∈ E,  Φ(i,j)=1. If this is so, then the edited code should be correct:)
gzc/CLRS,gzc/CLRS,gzc/CLRS