]> mj.ucw.cz Git - libucw.git/commit
projects / libucw.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: ae6bed0) | patch
Added a very simple generic implementation of binomial heaps. Their main
authorMartin Mares <mj@ucw.cz>
Wed, 18 Jun 2003 13:07:10 +0000 (13:07 +0000)
committerMartin Mares <mj@ucw.cz>
Wed, 18 Jun 2003 13:07:10 +0000 (13:07 +0000)
commit1aa5b092dce1eabfc4ac2460abf9454341bc79f1
tree1147a106ff36b2f882c70b0e5f84a26c1683c904tree | snapshot
parentae6bed064b77a1ecfe72ca357152abb6970b70cacommit | diff
Added a very simple generic implementation of binomial heaps. Their main
virtue is that they are fully dynamic, needing no upper bounds on the
number of items nor frequent reallocations. Their main disadvantage is
the need of 13 bytes per node.

I did implement only those heap operations I'll use in the gatherer,
I'll add more later.
lib/Makefile diff | blob | history
lib/binheap-node.h [new file with mode: 0644] blob
lib/binheap-test.c [new file with mode: 0644] blob
lib/binheap.h [new file with mode: 0644] blob
UCW libraries