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) – A NetworkX graph Returns: nodes – Dictionary of nodes with in-degree centrality as values. Return type: dictionary Raises: NetworkXNotImplemented: – If G is undirected.
The degree centrality values are normalized by dividing by the maximum possible degree in a simple graph n-1 where n is the number of nodes in G.
For multigraphs or graphs with self loops the maximum degree might be higher than n-1 and values of degree centrality greater than 1 are possible.