Home
last modified time | relevance | path

Searched refs:current_bucket (Results 1 – 2 of 2) sorted by relevance

/third_party/boost/boost/graph/distributed/
Ddelta_stepping_shortest_paths.hpp253 BucketIndex current_bucket = 0; in run() local
259 while (current_bucket < buckets.size() in run()
260 && (!buckets[current_bucket] || buckets[current_bucket]->empty())) in run()
261 ++current_bucket; in run()
262 if (current_bucket >= buckets.size()) in run()
263 current_bucket = max_bucket; in run()
267 << current_bucket << std::endl; in run()
273 current_bucket = all_reduce(pg, current_bucket, minimum<BucketIndex>()); in run()
275 if (current_bucket == max_bucket) in run()
281 std::cerr << "Processing bucket #" << current_bucket << std::endl; in run()
[all …]
Dbetweenness_centrality.hpp346 BucketIndex current_bucket = 0; in run() local
360 while (current_bucket < buckets.size() in run()
361 && (!buckets[current_bucket] || buckets[current_bucket]->empty())) in run()
362 ++current_bucket; in run()
363 if (current_bucket >= buckets.size()) in run()
364 current_bucket = max_bucket; in run()
370 current_bucket = all_reduce(pg, current_bucket, minimum<BucketIndex>()); in run()
372 if (current_bucket == max_bucket) in run()
387 if (current_bucket < buckets.size() && buckets[current_bucket]) { in run()
388 Bucket& bucket = *buckets[current_bucket]; in run()
[all …]