grape.general_graph.GeneralGraph.betweenness_centrality_kernel¶

GeneralGraph.betweenness_centrality_kernel(nodes, tot_shortest_paths_list)[source]¶

Compute betweenness centrality, from shortest path list.

Parameters

nodes (list) – list of nodes for which to compute the efficiency between them and all the other nodes.
tot_shortest_paths_list (list or multiprocessing.managers.list) – list of shortest paths with at least two nodes.

Returns

between centrality dictionary keyed by node.

Return type