You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Degree centrality - the number of edges each node has
Betweenness centrality - the number of times a node lies of the shortest path between all pairs of nodes
Closeness centrality: Sum of the shortest distances to all nodes
EigenCentrality - node centrality based on links and connectedness
PageRank is a variant, which also takes link direction and weight into account
Of course, most of those require a bit of computation. Still, they could be really informative, and probably quite useful on a graph with hundreds to thousands of nodes.
Currently only two options are supported to control the node size:
Would be helpful to also have a combined measure:
The text was updated successfully, but these errors were encountered: