The project aims at applying algorithms based on graph theory to compute the centrality property for each node in undirected connected graph.
Algorithms implemented using C++ and virtualization using Qt.
- Degree Centrality
- Closeness centrality
- Betweenness Centrality
Type of centrality then Number of nodes and number of edges and their weights.
Centrality for nodes printed ascendingly according to the node’s id.
Visualization of the graph such that nodes with higher centrality are clear.