util.queue

Class FibonacciHeap<T>

java.lang.Object

util.queue.FibonacciHeap<T>

All Implemented Interfaces:

ExtendedPriorityQueue<T>, PriorityQueue<T>, SoftPriorityQueue<T>

public class FibonacciHeap<T>
extends java.lang.Object
implements ExtendedPriorityQueue<T>

Constructor Summary

Constructors

Constructor and Description
FibonacciHeap(java.util.Comparator<? super T> c)

Method Summary

Modifier and Type	Method and Description
void	decrease(long id)
void	insert(T element) Inserts an element into the queue.
long	insertWithId(T element)
static <S extends java.lang.Comparable<? super S>> FibonacciHeap<S>	naturallyOrdered()
T	peek() Peeks into the top of the queue, returning the element which is believed to have minimal key.
T	pop() Peeks into the top of the queue, returning the element which is believed to have minimal key.
int	size() Returns the size of the queue.
java.lang.String	toString()

Methods inherited from class java.lang.Object

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

Methods inherited from interface util.queue.PriorityQueue

corrupted

Methods inherited from interface util.queue.SoftPriorityQueue

empty

Constructor Detail

FibonacciHeap

public FibonacciHeap(java.util.Comparator<? super T> c)

Method Detail

naturallyOrdered

public static <S extends java.lang.Comparable<? super S>> FibonacciHeap<S> naturallyOrdered()

peek

public T peek()

Description copied from interface: SoftPriorityQueue

Peeks into the top of the queue, returning the element which is believed to have minimal key. Does not remove the item from the queue.

Specified by:

peek in interface SoftPriorityQueue<T>

Returns:

the item with the minimal key

insert

public void insert(T element)

Description copied from interface: SoftPriorityQueue

Inserts an element into the queue. The item or other items may be corrupted in the process.

Specified by:

insert in interface SoftPriorityQueue<T>

Parameters:

element - the element to be inserted

insertWithId

public long insertWithId(T element)

Specified by:

insertWithId in interface ExtendedPriorityQueue<T>

size

public int size()

Description copied from interface: SoftPriorityQueue

Returns the size of the queue.

Specified by:

size in interface SoftPriorityQueue<T>

Returns:

the size of the queue

pop

public T pop()

Description copied from interface: SoftPriorityQueue

Peeks into the top of the queue, returning the element which is believed to have minimal key. The item will get removed from the queue in the process.

Specified by:

pop in interface SoftPriorityQueue<T>

Returns:

the item with the minimal key

decrease

public void decrease(long id)

Specified by:

decrease in interface ExtendedPriorityQueue<T>

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object