Betweenness Centrality algorithm

From Glitchdata
Jump to navigation Jump to search

Betweenness centrality is a way of detecting the amount of influence a node has over the flow of information in a graph. It is often used to find nodes that serve as a bridge from one part of a graph to another.