Is there a manner to run the betweenness algorithm only up to a certain weighted depth from each e / v, instead of for the whole graph?
Similar, for example, to the topology.shortest_distance algorithm which includes an optional input for max_dist. Thanks, Gareth _______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
