Closeness centrality approximation for undirected graphs with Eppstein-Wang algorithm
-
Updated
Feb 4, 2024 - C++
Closeness centrality approximation for undirected graphs with Eppstein-Wang algorithm
This project was created for Graph-Based Analysis for Big Data in Social Networks class at College of Staten Island (CUNY) in December 2020.
Add a description, image, and links to the closeness-centrality topic page so that developers can more easily learn about it.
To associate your repository with the closeness-centrality topic, visit your repo's landing page and select "manage topics."