genpranav/Brandes-Algorithm-Betweenness-Centrality

The goal of this project is to implement the Brandes algorithm for calculating betweenness centrality in a graph. The Brandes algorithm is a well-known algorithm for efficiently computing betweenness centrality in large, complex networks.

Jupyter Notebook