A priority queue implementation for use with the anasi graph library.
A priority queue implementation. Items with the highest priority (as defined by the supplied predicate) come off the queue first. You can change the order of the queue by supplying a custom predicate, or overriding opCmp on the type being queued.
See Source File
Boost Software License 1.0.
A priority queue implementation for use with the anasi graph library.