pIntroduction:/p
pIt aims to figure out the shortest path from each vertex v to every other u. Storing all the/p
ppaths explicitly can be very memory expensive indeed, as we need one spanning tree/p
pfor each vertex. This is often impractical regarding memory consumption, so these are/p
pgenerally considered as all pairs-shortest distance problems, which aim to find just the/p
pdistance from each to each node to another./p
pIt aims to figure out the shortest path from each vertex v to every other u. Storing all the/p
ppaths explicitly can be very memory expensive indeed, as we need one spanning tree/p
pfor each vertex. This is often impractical regarding memory consumption, so these are/p
pgenerally considered as all pairs-shortest distance problems, which aim to find just the/p
pdistance from each to each node to another./p
