./devel/py-pqueue, Priority-queues using fibonacci heaps

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2013Q4, Version: 0.2nb1, Package name: py27-pqueue-0.2nb1, Maintainer: pkgsrc-users

This C extension implements a priority-queue object using a fibonacci
heap as the underlying data structure. This data structure supports
the following operations with the given amortized time-complexity:

- insert: O(1)
- find-min: O(1)
- extract-min: O(lg N)
- decrease-key: O(1)
- increase-key: O(lg N) (== delete, insert)
- delete: O(lg N) (== decrease-key, extract-min)


Required to run:
[lang/python27]

Master sites:

SHA1: 3da4fb4b8bd9b944893323930d1cb7819122a22d
RMD160: 47584234a678b6b6d26da350e9ca26e0b5b43142
Filesize: 49.825 KB

Version history: (Expand)