The algorithm class that scans an entire graph
and stores the results in two arrays
- distance array and P
- path array).
This class of algorithms
is useful for a once-in-a-program scanning of a graph and is tipically used to build a distance table between cities that you normally find on a road map