Function weakly_connected_components 

pub fn weakly_connected_components<N, E, Ix>(
    graph: &DiGraph<N, E, Ix>,
) -> Vec<Component<N>> 
where
    N: Node + Debug,
    E: EdgeWeight,
    Ix: IndexType,

Finds all weakly connected components in a directed graph

Weakly connected components are found by treating the directed graph as undirected and finding connected components. Two vertices are in the same weakly connected component if there is an undirected path between them.

Arguments

• graph - The directed graph to analyze

Returns

• A vector of weakly connected components