out_degree_centrality(G)
The out-degree centrality for a node v is the fraction of nodes its outgoing edges are connected to.
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.
A NetworkX graph
If G is undirected.
Dictionary of nodes with out-degree centrality as values.
Compute the out-degree centrality for nodes.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.centrality.degree_alg.in_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