The functions that calculate shortest paths make use of two algorithms:

Algorithm		Application
Dijkstra		for graphs without edges with negative weights
FiFo		for graphs without cycles with negative length

Implemented are the following functions:

Function		Short Description
ShortestPathFromOneToOne		shortest path between two vertices
ShortestPathsFromOneToAll		shortest paths to all other vertices
ShortestPathsFromAllToOne		shortest paths from all other vertices
ShortestPathsFromAllToAll		shortest paths between all vertices

The facing column contains an example for ShortestPathsFromAllToOne.