Boost logo

Boost :

Subject: Re: [boost] GSoC 2010: Heaps and Queues
From: Dan Larkin (danielhlarkin_at_[hidden])
Date: 2010-03-26 11:54:36

> - findMin
> - deleteMin
> - insert
> - changeKey
> - merge
> These can all be implemented quite efficiently (either worst case or
> amortized O(logn) time or better) for any heap model.

Just realized this isn't entirely true. A merge on two heaps can be
O(n) depending on the model.

In any case, still eagerly awaiting some sort of feedback.

Dan Larkin

Boost list run by bdawes at, gregod at, cpdaniel at, john at