Compute the in-degree centrality for nodes.
The in-degree centrality for a node v is the fraction of nodes its incoming edges are connected to.
Parameters: | G : graph
|
---|---|
Returns: | nodes : dictionary
|
See also
degree_centrality, out_degree_centrality, Notes, -----, The, possible, For, be, are