cnslab.cnsmath

Class FibonacciHeap<T2 extends Comparable<T2>>

java.lang.Object

cnslab.cnsmath.FibonacciHeap<T2>

public class FibonacciHeap<T2 extends Comparable<T2>>
extends Object

A Fibonacci Heap, as described in Introduction to Algorithms by Charles E. Leiserson, Thomas H. Cormen, Ronald L. Rivest.

A Fibonacci heap is a very efficient data structure for priority queuing.

Constructor Summary

Constructors

Constructor and Description
FibonacciHeap() Creates a new FibonacciHeap.

Method Summary

Methods

Modifier and Type	Method and Description
void	add(T2 priority) Adds the Object item, with the supplied priority.
T2	peekMin() Returns the same Object that popMin() would, without removing it.
T2	popMin() Returns the object which has the lowest priority in the heap.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

FibonacciHeap

public FibonacciHeap()

Creates a new FibonacciHeap.

Method Detail

add

public void add(T2 priority)

Adds the Object item, with the supplied priority.

Parameters:

item - the item to be added.

priority - the priority of the item.

peekMin

public T2 peekMin()

Returns the same Object that popMin() would, without removing it.

Returns:

the min item without removing it.

popMin

public T2 popMin()

Returns the object which has the lowest priority in the heap. If the heap is empty, null is returned.

Returns:

returns the min item removing it from the heap.