A utility that efficiently calculates Closeness, Node Betweenness and Edge Betweenness of a given connected, undirected graph.
The implementation is based on [1] and was extended to simultaneously calculate Closeness and Edge Betweenness metrics as well. Time complexity is O(nm) for non-weighted and O((nm + n^2)logn) for weighted graphs.
The program accepts input generated by the Pajek [2] software package with ".net" extension (saved as "Pajek Arcs/Edges (*.net)"). Using Pajek, you can automatically generate a variety of graph, or even visually design one.
The program generates four output files. General input graph stats, Closeness, Node Betweenness and Edge Betweenness values.
[1] Ulrik Brandes - A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2), 163-177 - 2001.
[2] Vladimir Batagelj, Andrej Mrvar - Pajek - Analysis and visualisation of large networks. - ISSN 1318-4865 - 2003.
Note: Implemented using Linux - using some Linux specific calls.
Centrality Measures Calculator (Closeness, Node Betweenness, Edge Betweenness)
Copyright (C) 2013 George Piskas