pub fn greedy_modularity_optimization<N, E, Ix>(
graph: &Graph<N, E, Ix>,
max_iterations: usize,
) -> CommunityStructure<N>
Expand description
Greedy modularity optimization algorithm
This is a simplified version of modularity optimization that uses a greedy approach without simulated annealing. It’s faster but may get stuck in local optima.
§Arguments
graph
- The graph to analyzemax_iterations
- Maximum number of iterations
§Returns
- A community structure with optimized modularity