EppsteinWangAlgorithm

Implementation of the Eppstein-Wang algorithm [1] for approximating closeness centrality in an undirected graph. Closeness centrality is approximated as: $$c(v)=\frac{n-1}{n/k \cdot sum_v}$$

where $sum_v$ is sum of all shortest paths from source $v$.

Warning

This project has been built for learning purposes, use it at your own risk

References

[1] Eppstein and J. Wang, Fast Approximation of Centrality, JGAA, 8(1) 39–45 (2004)45.