All Packages  Class Hierarchy  This Package  Previous  Next  Index

Class structure.VectorHeap 

java.lang.Object
    |
    +----structure.VectorHeap
public class VectorHeap
extends Object
implements PriorityQueue
This class implements a priority queue based on a traditional array-based heap.

Constructor Index

o VectorHeap()
Construct a new priority queue.
o VectorHeap(Vector)
Construct a new priority queue from an unordered vector

Postcondition:
constructs a new priority queue from an unordered vector.

Method Index

o add(Comparable)
Add a value to the priority queue.
o clear()
Remove all the elements from the queue.
o isEmpty()
Determine if the queue is empty.
o peek()
Fetch lowest valued (highest priority) item from queue.
o remove()
Returns the minimum value from the queue.
o size()
Determine the size of the queue.
o toString()
Construct a string representation of the heap.

Constructors

o VectorHeap 
public VectorHeap()
Construct a new priority queue.

Postcondition:
constructs a new priority queue.

o VectorHeap 
public VectorHeap(Vector v)
Construct a new priority queue from an unordered vector

Postcondition:
constructs a new priority queue from an unordered vector.

Methods

o peek 
public Comparable peek()
Fetch lowest valued (highest priority) item from queue.

Precondition:
!isEmpty()
Postcondition:
returns the minimum value in priority queue

Returns:
The smallest value from queue.
o remove 
public Comparable remove()
Returns the minimum value from the queue.

Precondition:
!isEmpty()
Postcondition:
returns and removes minimum value from queue

Returns:
The minimum value in the queue.
o add 
public void add(Comparable value)
Add a value to the priority queue.

Precondition:
value is non-null comparable
Postcondition:
value is added to priority queue

Parameters:
value - The value to be added.
o isEmpty 
public boolean isEmpty()
Determine if the queue is empty.

Postcondition:
returns true iff no elements are in queue

Returns:
True if the queue is empty.
o size 
public int size()
Determine the size of the queue.

Postcondition:
returns number of elements within queue

Returns:
The number of elements within the queue.
o clear 
public void clear()
Remove all the elements from the queue.

Postcondition:
removes all elements from queue

o toString 
public String toString()
Construct a string representation of the heap.

Postcondition:
returns string representation of heap

Returns:
The string representing the heap.
Overrides:
toString in class Object
All Packages  Class Hierarchy  This Package  Previous  Next  Index