scirs2_graph::algorithms::decomposition

Function k_core_decomposition

Source 
pub fn k_core_decomposition<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
) -> HashMap<N, usize>
where
    N: Node + Clone + Hash + Eq,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

K-core decomposition of a graph

The k-core of a graph is the maximal subgraph where every node has degree at least k. This function returns a mapping from each node to its core number (the maximum k for which the node belongs to the k-core).