Calculates betweenness centrality of network nodes from shortest path counts: C_B(v) = Σ σ(s,t|v)/σ(s,t), identifying bridge nodes in a graph. High betweenness nodes are critical for information flow — removing them fragments the network more than removing high-degree nodes in scale-free networks.
Inputs
N Nodes
Count of items or occurrences.
E Edges
Count of items or occurrences.
Path Count
Reference formula or conversion factor shown for context.
Results
betweenness centrality CB
Sample size or count used in the calculation.
network density
Sample size or count used in the calculation.
average node degree
The arithmetic mean -- sum divided by count.
maximum possible paths (denominator)
The largest value in the dataset or feasible range.
CB = σ_through / (N−1)(N−2)/2
Sample size or count used in the calculation.
network type
The classification or type assigned based on the inputs.