group_in_degree_centrality(G, S)
Group in-degree centrality of a group of nodes $S$ is the fraction of non-group members connected to group members by incoming edges.
The number of nodes in the group must be a maximum of n - 1 where n is the total number of nodes in the graph.
:None:None:`G.neighbors(i)` gives nodes with an outward edge from i, in a DiGraph, so for group in-degree centrality, the reverse graph is used.
A NetworkX graph.
S is a group of nodes which belong to G, for which group in-degree centrality is to be calculated.
If G is undirected.
If node(s) in S are not in G.
Group in-degree centrality of the group S.
Compute the group in-degree centrality for a group of nodes.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.centrality.group.group_degree_centrality
networkx.algorithms.centrality.group.group_out_degree_centrality
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them