Algorithms use an
w to represent graphs, where
Negative weights are allowed, but not negative cycles.
Algorithms output a
is the weight of the shortest path from i to j.
Algorithms may also output
is NIL if either i=j or there is no path from i to j; otherwise,
is the predecessor of j on a shortest path from i.
From the predecessor matrix
, we can derive the
for each vertex i