From: Brian H. <bh...@sp...> - 2003-03-11 19:41:42
|
Second of three libraries I am submitting for comments: Psqueue. This library implements a Priority Search Queue, based up Ralf Hinze's paper, see: http://citeseer.nj.nec.com/hinze01simple.html Priority search queues provide the best behavior of both search trees (O(log n) insert, delete, and find based upon a key-data mapping) and priority queues (O(1) to find the highest priority element, O(log n) to change the priority of any element). This implementation is based around Red-Black trees. Brian |