allShortestHopPaths
fun <T> Environment<T, *>.allShortestHopPaths(): Map<Environments.UndirectedEdge<T>, Double>(source)
Calculates the shortest paths using the Floyd-Warshall algorithm calculating the Hop Distance between nodes.