|
|||||||||
| Home >> All >> Util >> [ Collections overview ] | PREV CLASS NEXT CLASS | ||||||||
SUMMARY: JAVADOC | SOURCE | DOWNLOAD | NESTED | FIELD | CONSTR | METHOD |
DETAIL: FIELD | CONSTR | METHOD | ||||||||
Util.Collections
Class FibonacciHeap

java.lang.ObjectUtil.Collections.FibonacciHeap
- public class FibonacciHeap
- extends java.lang.Object
FibonacciHeap
- Version:
- $Id: FibonacciHeap.java,v 1.1 2003/06/16 17:21:46 joewhaley Exp $
| Nested Class Summary | |
(package private) static class |
FibonacciHeap.List
|
(package private) static class |
FibonacciHeap.Node
|
| Field Summary | |
protected FibonacciHeap.Node |
min
|
protected FibonacciHeap.List |
rootlist
|
protected int |
size
|
| Constructor Summary | |
FibonacciHeap()
|
|
| Method Summary | |
private void |
cascadingCut(FibonacciHeap.Node v)
|
private void |
consolidate()
|
private void |
cut(FibonacciHeap.Node v)
|
private void |
cut2(FibonacciHeap.Node v)
|
void |
decreaseKey(int k,
FibonacciHeap.Node p)
|
void |
decreaseKey2(int k,
FibonacciHeap.Node p)
|
void |
delete(FibonacciHeap.Node p)
|
FibonacciHeap.Node |
deleteMin()
|
boolean |
empty()
|
FibonacciHeap.Node |
insert(int k,
java.lang.Object p)
|
private FibonacciHeap.Node |
link(FibonacciHeap.Node x,
FibonacciHeap.Node y)
|
private int |
log(int n)
|
void |
meld(FibonacciHeap Q)
|
FibonacciHeap.Node |
min()
|
void |
print()
|
private void |
tableInsert(FibonacciHeap.Node[] A,
FibonacciHeap.Node x)
|
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
rootlist
protected FibonacciHeap.List rootlist
min
protected FibonacciHeap.Node min
size
protected int size
| Constructor Detail |
FibonacciHeap
public FibonacciHeap()
| Method Detail |
empty
public boolean empty()
meld
public void meld(FibonacciHeap Q)
insert
public FibonacciHeap.Node insert(int k, java.lang.Object p)
link
private FibonacciHeap.Node link(FibonacciHeap.Node x, FibonacciHeap.Node y)
tableInsert
private void tableInsert(FibonacciHeap.Node[] A, FibonacciHeap.Node x)
log
private int log(int n)
consolidate
private void consolidate()
deleteMin
public FibonacciHeap.Node deleteMin()
cut2
private void cut2(FibonacciHeap.Node v)
cascadingCut
private void cascadingCut(FibonacciHeap.Node v)
decreaseKey2
public void decreaseKey2(int k,
FibonacciHeap.Node p)
cut
private void cut(FibonacciHeap.Node v)
decreaseKey
public void decreaseKey(int k,
FibonacciHeap.Node p)
delete
public void delete(FibonacciHeap.Node p)
min
public FibonacciHeap.Node min()
public void print()
|
|||||||||
| Home >> All >> Util >> [ Collections overview ] | PREV CLASS NEXT CLASS | ||||||||
SUMMARY: JAVADOC | SOURCE | DOWNLOAD | NESTED | FIELD | CONSTR | METHOD |
DETAIL: FIELD | CONSTR | METHOD | ||||||||
JAVADOC
Util.Collections.FibonacciHeap