diff options
| author | Jimmy Olgeni <olgeni@FreeBSD.org> | 2008-06-01 09:42:37 +0000 |
|---|---|---|
| committer | Jimmy Olgeni <olgeni@FreeBSD.org> | 2008-06-01 09:42:37 +0000 |
| commit | a249020977a2394eb6f6b41a59e49167878d5f8d (patch) | |
| tree | 5d607d247327f1beb39661a2ddfb9b78f6f2cd45 /devel/fib | |
| parent | 75ef30fdb03f8f8cf0ccf2ea00b086adac621054 (diff) | |
| download | ports-a249020977a2394eb6f6b41a59e49167878d5f8d.tar.gz ports-a249020977a2394eb6f6b41a59e49167878d5f8d.zip | |
Notes
Diffstat (limited to 'devel/fib')
| -rw-r--r-- | devel/fib/pkg-descr | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/devel/fib/pkg-descr b/devel/fib/pkg-descr index 9abb7d31f371..f40bf502412f 100644 --- a/devel/fib/pkg-descr +++ b/devel/fib/pkg-descr @@ -1,7 +1,7 @@ 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 +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 |