grape.general_graph.GeneralGraph.compute_degree_centrality¶
-
GeneralGraph.compute_degree_centrality()[source]¶ Degree centrality measure of each node calculation.
Note
Degree centrality is a simple centrality measure that counts how many neighbors a node has in an undirected graph. The more neighbors the node has the most important it is, occupying a strategic position that serves as a source or conduit for large volumes of flux transactions with other nodes. A node with high degree centrality is a node with many dependencies.
- Returns
degree centrality computed for every node.
- Return type