Template Class BucketQueue

Class Documentation

template <typename T>
class BucketQueue

Bucketed priority queue, mostly following L.

Yatziv et al in O(N) Implementation of the Fast Marching Algorithm, though skipping the circular aspect (don’t care about a bit more memory used for this).

Public Functions

BucketQueue()
BucketQueue(int num_buckets, double max_val)
void setNumBuckets(int num_buckets, double max_val)

WARNING: will CLEAR THE QUEUE!

void push(const T &key, double value)
void pop()
T front()
bool empty()
void clear()