Function generic_floyd_warshall::floyd_warshall

pub fn floyd_warshall<N, M, V>(graph: &N, size: usize) -> N where
    V: Add<Output = V> + PartialOrd + Copy + Clone + Sized,
    M: IndexMut<usize, Output = V> + Clone + Sized,
    N: IndexMut<usize, Output = M> + Clone + Sized, 

Generic implementation of the Floyd-Warshall algorithm for finding the shortest paths in a weighted graph.