Function pathfinding::undirected::prim::prim

source ยท 
pub fn prim<N, C>(edges: &[(N, N, C)]) -> Vec<(&N, &N, C)>
where
    N: Hash + Eq + Ord,
    C: Clone + Ord,
Expand description

Find a minimum-spanning-tree. From a collection of weighted edges, return a vector of edges forming a minimum-spanning-tree.