summaryrefslogtreecommitdiff
path: root/devel/fib/pkg-descr
diff options
context:
space:
mode:
Diffstat (limited to 'devel/fib/pkg-descr')
-rw-r--r--devel/fib/pkg-descr7
1 files changed, 0 insertions, 7 deletions
diff --git a/devel/fib/pkg-descr b/devel/fib/pkg-descr
deleted file mode 100644
index f40bf502412f..000000000000
--- a/devel/fib/pkg-descr
+++ /dev/null
@@ -1,7 +0,0 @@
-This is an implementation of a Fibonacci Heap. A Fibonacci Heap is
-a very efficient heap. The cost of an insert is O(1), and the amortized
-cost of an extract minimum is O(lgn). You can extract an already inserted
-item out of order in O(lgn). The way the Fibonacci heap obtains this is
-by delaying the organizing of the items until you extract.
-
-WWW: http://resnet.uoregon.edu/~gurney_j/jmpc/fib.html