global_reaching_centrality(G, weight=None, normalized=True)
The global reaching centrality of a weighted directed graph is the average over all nodes of the difference between the local reaching centrality of the node and the greatest local reaching centrality of any node in the graph . For more information on the local reaching centrality, see local_reaching_centrality
. Informally, the local reaching centrality is the proportion of the graph that is reachable from the neighbors of the node.
A networkx DiGraph.
Attribute to use for edge weights. If None
, each edge weight is assumed to be one. A higher weight implies a stronger connection between nodes and a shorter path length.
Whether to normalize the edge weights by the total sum of edge weights.
The global reaching centrality of the graph.
Returns the global reaching centrality of a directed graph.
>>> G = nx.DiGraph()
... G.add_edge(1, 2)
... G.add_edge(1, 3)
... nx.global_reaching_centrality(G) 1.0
>>> G.add_edge(3, 2)See :
... nx.global_reaching_centrality(G) 0.75
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.centrality.reaching.global_reaching_centrality
networkx.algorithms.centrality.reaching.local_reaching_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