Function temporal_networks::algorithms::floyd_warshall

pub fn floyd_warshall(
    graph: &DiGraphMap<i32, f64>
) -> Result<BTreeMap<(i32, i32), f64>, String>

Similar to Python's networkx Floyd Warshall implementation. Performs all-pairs shortest paths against a graph and returns a mapping of the shortest paths