3 ms·
Isn't that actually an example for graph centrality (betweenness)? https://en.wikipedia.org/wiki/Centrality https://en.wikipedia.org/wiki/Centrality
by elcapitan 11y ago
Isn't that actually an example for graph centrality (betweenness)? https://en.wikipedia.org/wiki/Centrality https://en.wikipedia.org/wiki/Centrality
- 14113 11y agoYes - one of the classical ways of computing betweeness centrality is to calculate the number of shortest paths passing through each edge. In this case however, he's only computing the shortest paths to/from a single vertex.