allShortestPaths
fun <T> Environment<T, *>.allShortestPaths(computeDistance: (Node<T>, Node<T>) -> Double = neighborDistanceMetric { n1, n2 ->
getDistanceBetweenNodes(n1, n2)
}): Map<Environments.UndirectedEdge<T>, Double>(source)
Computes all the minimum distances with the provided metric using the Floyd–Warshall algorithm.