hypergraph_connected_components

scirs2_graph::algorithms::hypergraph

Function hypergraph_connected_components 

Source 
pub fn hypergraph_connected_components<N, E, Ix>(
    hypergraph: &Hypergraph<N, E, Ix>,
) -> Vec<HashSet<N>>
where
    N: Node + Clone + Ord + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Find strongly connected components in a directed hypergraph

This is an extension of the concept to hypergraphs by treating hyperedges as directed from one subset of nodes to another. For simplicity, this implementation treats hyperedges as connecting all nodes bidirectionally.

§Arguments

  • hypergraph - The hypergraph to analyze

§Returns

  • Vector of strongly connected components (as sets of nodes)