3 commits

Author	SHA1	Message	Date
Oliver Gugger	ed40eddafd	autopilot: return early for empty graph ... This fixes an issue where the diameter calculation would crash if the graph is empty.	2022-06-16 10:10:27 +02:00
bitromortac	52d56a8990	lnrpc+autopilot: add graph diameter calculation ... * adds a brute force computation of the diameter * adds a more efficient calculation of the diameter	2022-03-07 11:15:47 +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