Class BinHeap

java.lang.Object
  |
  +--BinHeap

All Implemented Interfaces:

MergeableQueue

public class BinHeap

extends java.lang.Object

implements MergeableQueue

Classe che implementa le code unificabili come insiemi di alberi binomiali.
Realizzata sulla base del capitolo 20 del testo:
Introduction to algorithms di T.H. Cormen, C.E. Leiserson, R.L. Rievest

Method Summary

java.lang.Comparable	Dequeue() rimuove il minimo dalla coda e lo ritorna
void	Enqueue(java.lang.Comparable k) accoda la chiave k
boolean	IsEmpty() ritorna true sse la coda è vuota
java.lang.Comparable	Minimum() ritorna il minimo senza rimuoverlo dalla coda
void	Union(MergeableQueue q) unione distruttiva della coda con q

Methods inherited from class java.lang.Object

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

Method Detail

IsEmpty

public boolean IsEmpty()

Description copied from interface: MergeableQueue

ritorna true sse la coda è vuota

Specified by:

IsEmpty in interface MergeableQueue

Enqueue

public void Enqueue(java.lang.Comparable k)

Description copied from interface: MergeableQueue

accoda la chiave k

Specified by:

Enqueue in interface MergeableQueue

Minimum

public java.lang.Comparable Minimum()

Description copied from interface: MergeableQueue

ritorna il minimo senza rimuoverlo dalla coda

Specified by:

Minimum in interface MergeableQueue

Dequeue

public java.lang.Comparable Dequeue()

Description copied from interface: MergeableQueue

rimuove il minimo dalla coda e lo ritorna

Specified by:

Dequeue in interface MergeableQueue

Union

public void Union(MergeableQueue q)

Description copied from interface: MergeableQueue

unione distruttiva della coda con q

Specified by:

Union in interface MergeableQueue