PriorityQueue-MEX-Matlab

This a mexified MATLAB wrapper of C++ STL priority queue

This a mexified MATLAB wrapper of C++ STL priority queue
This priority queue implementation is simple. Nevertheless, it can be used to keep a "sorted" list of arbitrary objects. Instead of pushing the entire object, we can push only its index. This is done by first storing the objects in MATLAB as you normally would. Then, you can push the index and its priority into the priority queue. When you take an element off the priority queue, you can use the index to find the object. This way, the priority queue given here is quite general.

This implementation keeps the priority queue sorted in descending order. In other words, calling the top_value function returns the largest priority value. You can easily make it operate in ascending order by supplying negative priorities.