From: "Brian Schröder" <ruby.brian@...>
Date: 2005-09-07T22:50:55+09:00
Subject: Re: Ruby Weekly News 29th August - 4th September 2005

> [snip news]
> 
>   Priority Queue 0.0.0 Homepage
>   -----------------------------
> 
>    Brian Schro:der uploaded his Priority Queue implementation (binomial
>    queue). It has:
> 
>    | O(1) insertion
>    | Amortized O(1) decrease key
>    | Amortized O(log n) delete min
> 
> [snip more news]

It may be my own fault, as I probably wrote something wrong in my
original announcement due to sleep deprivation, but it is a fibonaccy
heap not a binomial queue. Binomial queues have O(log n) decrease key
and O(log n) insertion costs.

thanks,

Brian


-- 
http://ruby.brian-schroeder.de/

Stringed instrument chords: http://chordlist.brian-schroeder.de/