pub fn infomap_communities<N, E, Ix>(
graph: &Graph<N, E, Ix>,
max_iterations: usize,
tolerance: f64,
) -> InfomapResult<N>
Expand description
Infomap algorithm for community detection
The Infomap algorithm uses information theory to find communities that minimize the description length of random walks on the graph. It optimizes the map equation which balances the cost of describing the partition with the cost of describing random walks within and between communities.
§Arguments
graph
- The undirected graph to analyzemax_iterations
- Maximum number of optimization iterationstolerance
- Convergence tolerance for code length improvement
§Returns
- An InfomapResult with node assignments, code length, and modularity