Skip to main content

parallel_connected_components

scirs2_graph::parallel_algorithms

Function parallel_connected_components 

Source 
pub fn parallel_connected_components(graph: &CsrGraph) -> ComponentsResult
Expand description

Find connected components using parallel label propagation with union-find.

Uses a lock-free union-find data structure where each edge (u, v) triggers a union operation. Edges are processed in parallel.

§Arguments

  • graph - An undirected CSR graph

§Returns

A ComponentsResult with component labels, count, and sizes.

§Note

For directed graphs, this finds weakly connected components (treating edges as undirected).