add py-pqueue-0.2, a fast priority-queue implementation

1 files changed, 10 insertions, 0 deletions

diff --git a/devel/py-pqueue/DESCR b/devel/py-pqueue/DESCR
new file mode 100644
index 00000000000..e762eed0a01
--- /dev/null
+++ b/devel/py-pqueue/DESCR
@@ -0,0 +1,10 @@
+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)