minimum_spanning_tree

scirs2_graph::algorithms

Function minimum_spanning_tree 

Source 
pub fn minimum_spanning_tree<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
) -> Result<Vec<Edge<N, E>>>
where
    N: Node + Debug,
    E: EdgeWeight + Into<f64> + PartialOrd,
    Ix: IndexType,
Expand description

Kruskal’s algorithm for finding minimum spanning tree

Returns a vector of edges that form the minimum spanning tree. Only works on undirected graphs.