greedy_modularity_optimization_result

scirs2_graph::algorithms::community::modularity

Function greedy_modularity_optimization_result 

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

Greedy modularity optimization algorithm (modern API)

Returns a standardized CommunityResult type that provides multiple ways to access the community structure.

§Arguments

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

§Returns

  • A CommunityResult with comprehensive community information