Pseudocode

Given the predecessor matrix $\Pi$, we can print the shortest path from i to j:

Print-Path($\Pi$, i, j)
$\;\;\;\;\;$if i = j
$\;\;\;\;\;$then print i
$\;\;\;\;\;$else if = NIL
$\;\;\;\;\;$ $\;\;\;\;\;$then print ``no path exists from i to j''
$\;\;\;\;\;$ $\;\;\;\;\;$else Print-Path($\Pi$, i, )
$\;\;\;\;\;$ $\;\;\;\;\;$ $\;\;\;\;\;$print j