scirs2_graph::algorithms::community

Function louvain_communities

Source 
pub fn louvain_communities<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
) -> CommunityStructure<N>
where
    N: Node,
    E: EdgeWeight + Into<f64> + Zero + Copy,
    Ix: IndexType,
Expand description

Detects communities in a graph using the Louvain method

The Louvain method is a greedy optimization algorithm that attempts to maximize the modularity of the network partition.

§Arguments

  • graph - The undirected graph to analyze

§Returns

  • A community structure with node assignments and modularity score