scirs2_graph::algorithms::community

Function fluid_communities

Source 
pub fn fluid_communities<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
    num_communities: usize,
    max_iterations: usize,
) -> CommunityStructure<N>
where
    N: Node + Clone + Hash + Eq,
    E: EdgeWeight + Into<f64> + Copy,
    Ix: IndexType,
Expand description

Fluid communities algorithm

Fluid communities is a density-based algorithm where communities are formed by propagating “fluids” through the network. Each community starts with a seed node and expands by including neighboring nodes based on density.

§Arguments

  • graph - The graph to analyze
  • num_communities - Target number of communities to find
  • max_iterations - Maximum number of iterations

§Returns

  • A community structure with node assignments and modularity