parallel_label_propagation_result

scirs2_graph::algorithms::community::parallel

Function parallel_label_propagation_result 

Source 
pub fn parallel_label_propagation_result<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
    max_iterations: Option<usize>,
) -> CommunityResult<N>
where
    N: Node + Clone + Hash + Eq + Send + Sync + Debug,
    E: EdgeWeight + Into<f64> + Copy + Send + Sync,
    Ix: IndexType + Send + Sync,
Expand description

Parallel implementation of label propagation community detection

Uses parallel processing to speed up the label propagation algorithm for large graphs.

§Arguments

  • graph - The graph to analyze
  • max_iterations - Maximum number of iterations to run

§Returns

  • A CommunityResult containing the detected communities