priority queue

[Carlos Ribeiro]

At 00:48 07/06/01 +0000, Courageous wrote:
>Use a standard binary heap. It will do absolutely fine in all general
>cases. Your other alternative is a fibonacci heap, which is optimized
>for insert. I have the binary heap at:
>
>http://www.sourceforge.net/projects/pythonic
>
>Checkout the "pythonic" module. The adt submodule is what you
>want. It also has a circular dequeue and a specialized python list
>which supports O(1) head-push and tail-append.

I'm also interested on your binary heap implementation, but I could not get 
the module at sourceforge. Any problem that you are aware?


Carlos Ribeiro