Function graph::wcc::wcc_afforest

source ·

pub fn wcc_afforest<NI, G>(graph: &G, config: WccConfig) -> impl Components<NI>where
    NI: Idx + Hash,
    G: Graph<NI> + DirectedDegrees<NI> + DirectedNeighbors<NI> + Sync,

Expand description

Computes Wcc using the Afforest algorithm backed by a disjoint set struct. The disjoint set struct performans path compression while searching the set id for a given node.