grape.parallel_general_graph.ParallelGeneralGraph.compute_indegree_centrality

ParallelGeneralGraph.compute_indegree_centrality()

In-degree centrality calculation.

Note

In-degree centrality is measured by the number of edges ending at the node in a directed graph. Nodes with high in-degree centrality are called cascade resulting nodes.

Returns

in-degree centrality computed for every node.

Return type

multiprocessing.managers.dict