3 commits

Author	SHA1	Message	Date
Andras Banki-Horvath	919710467e	autopilot: tidying up source code to fit to 80 cols	2020-03-30 16:36:13 +02:00
Andras Banki-Horvath	608354032c	autopilot: parallelize betweenness centrality ... This commit parallelizes betweenness centrality calculation, by distributing the algo to N workers and creating partial results.	2020-03-27 13:56:10 +01:00
Andras Banki-Horvath	3fe9c70722	autopilot: betweenness centrality using Brandes algo on simplifed graph ... This commit adds betweenness centrality to the available node metrics. Betweenness centrality is a per node centrality measure which for an arbitrary node v equals to the sum of shortest paths going trough v divided by the number of all shortest paths for for each vertex pair k, s where k != s != v.	2020-03-27 10:39:50 +01:00