Function pathfinding::undirected::kruskal::kruskal

pub fn kruskal<N, C>(
    edges: &[(N, N, C)]
) -> impl Iterator<Item = (N, N, C)> where
    N: Clone + Hash + Eq,
    C: Clone + Ord, 

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