Hello! On 25 April 2013 03:15, Gábor Csárdi <[email protected]> wrote: > Hi, AFAIK you need to compute all shortest paths to compute the betweenness > of a single vertex, at least igraph does it this way and I am not aware of a > better algorithm.
An idea would be to copy (or patch) the betweenness function and parallelize the shortest path finding loop. https://github.com/igraph/igraph/blob/develop/src/centrality.c#L1666 If you do that I would be very much interested in this patch as I also have a problem with my betweenness runtime (40+min) :-( Kind regards, Jan -- Jan Schulz mail: [email protected] web: http://www.katzien.de _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
