Function graph::wcc::wcc_afforest_dss

source ·

pub fn wcc_afforest_dss<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 as described in the original paper (see module description). The backing union find structure can achieve better cache locality compared to the disjoint set struct variant.