Function hierarchical_communities 

pub fn hierarchical_communities<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
    linkage: &str,
) -> Vec<CommunityStructure<N>>
where
    N: Node + Clone + Hash + Eq + Debug,
    E: EdgeWeight + Into<f64> + Copy,
    Ix: IndexType,

👎Deprecated since 0.1.0-beta.2: Use hierarchical_communities_result instead

Hierarchical community structure using agglomerative clustering (legacy API)

Note: This function is deprecated in favor of hierarchical_communities_result. It will be removed in version 2.0.

This algorithm starts with each node as its own community and iteratively merges communities to maximize modularity. It builds a dendrogram-like structure showing the hierarchy of communities.

Arguments

• graph - The graph to analyze
• linkage - Linkage criterion (“single”, “complete”, “average”)

Returns

• A vector of community structures at different hierarchy levels