distance
Retrieves the shortest distance between two nodes in the graph.
This function uses the results of the Floyd-Warshall algorithm to determine the shortest path distance between the specified nodes.
Return
The shortest distance between the two nodes.
Parameters
u
The starting node.
v
The target node.
Throws
If allPairsShortestPaths() has not successfully computed any results before calling this function, or if u or v is not found in the graph.