strongly_connected_components

scirs2_graph::algorithms::connectivity

Function strongly_connected_components 

Source 
pub fn strongly_connected_components<N, E, Ix>(
    graph: &DiGraph<N, E, Ix>,
) -> Vec<Component<N>> ⓘ
where
    N: Node + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Finds all strongly connected components in a directed graph using Tarjan’s algorithm

§Arguments

  • graph - The directed graph to analyze

§Returns

  • A vector of strongly connected components