github.com/menefotto/pqueue

pqueue

Package pqueue provides a simple priority queue implementation

Queue can be either a max or min priority queue depending on the given Comparator function.

How do I use it?

In order to use it as max priority queue instantiate a pqueue with the New method like so:

    func less(i, j int, values []interface{}) bool {
        l, _ := values[i].(int)
        r, _ := values[j].(int)
        return l < r
    }

    pq := pqueue.New(less)

Otherwise if one wants to create min priority queue instantiate qa pqueue with the New method and a great Comparator function like so:

    func greater(i ,j int, values []interface{}) bool {
        l, _ := values[i].(int)
        r, _ := values[j].(int)
        return l > r
    }

    pq := pqueue.New(great)

Type casting inside the Comparator function is essential since comparison cannot be performed on interfaces. To extract the largest or smallest value ( depending on the queue ), call the Top method or to extract and remove it call PopTop, like so:

    v := pq.PopTop() // removes the values
    v := pq.Top() // gives a copy of the value not removing it from the queue

Important

• Nothing to add

Philosophy

This software is developed following the "mantra" keep it simple, stupid or better known as KISS.

Thank You Notes

Implementation follows closely the implementation given in "Algorithms by Robert Sedgewick".