This repository contains codes used for testing various examples for the proposal. The algorithm I proposed to implement is Brandes' Betweenness Centrality
which is used to calculate centrality values of each node.
The algorithm has been tested on various types of graphs like:
- Unweighted Undirected
- Weighted undirected
- Unweighted directed (pgRouting sample data)
- GNU G++ / MSVC compiler
- Boost C++ Library
c++ -I path/to/boost_1_75_0 example.cpp -o example
./example
More details: https://boost.org/doc/libs/1_75_0/more/getting_started/unix-variants.html
- Unweighted directed graph (pgRouting sample data)
- Weighted undirected graph