Path to this page:
./
devel/py-pqueue,
Priority-queues using fibonacci heaps
Branch: CURRENT,
Version: 0.2nb1,
Package name: py27-pqueue-0.2nb1,
Maintainer: pkgsrc-usersThis 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]
Required to build:[
pkgtools/cwrappers]
Master sites:
Filesize: 49.825 KB
Version history: (Expand)
- (2017-11-23) Package has been reborn
- (2012-10-31) Updated to version: py27-pqueue-0.2nb1
- (2011-10-16) Updated to version: py26-pqueue-0.2nb1
- (2009-02-12) Updated to version: py25-pqueue-0.2nb1
- (2007-03-21) Updated to version: py24-pqueue-0.2nb1
- (2006-02-06) Updated to version: py23-pqueue-0.2nb1
CVS history: (Expand)