Skip to main content

all_pairs_shortest

proof_engine::graph::pathfinding

Function all_pairs_shortest 

Source 
pub fn all_pairs_shortest<N, E>(
    graph: &Graph<N, E>,
) -> HashMap<(NodeId, NodeId), f32>
Expand description

Floyd-Warshall: all-pairs shortest paths.