Priority Queue

A simple priority queue designed for use with 1xN matlab vectors where the comparator column can be defined during construction.

A simple priority queue designed for use with 1xN matlab vectors where the comparator column can be defined during construction. Utilizes a minheap to ensure quick operations even with queues of larger size (100,000 elements). The following methods are currently implemented: insert, remove, peek, size, clear, contains, elements. Insert allows for 1xN vectors where the only requirement for N is that it must be greater or equal to the comparator column defined during initialization. Remove will remove and return the first element of the queue, or any matching vectors if an input vector is given. Peek returns the first element of queue without removing. Contains returns 1 if a specified vector is found in the queue, 0 otherwise. Elements returns the full queue cell array.