Advanced Data Structures - Java Concepts - page 1022

186 */
187 private Comparable getParent( int index)
188 {
189 return elements.get(index / 2 );
190 }
191
192 private ArrayList<Comparable> elements;
193 }

ch16/pqueue/HeapDemo.java

1 /**
2 This program demonstrates the use of a heap as a priority queue.
3 */
4 public class HeapDemo
5 {
6 public static void main(String[] args)
7 {
8 MinHeap q = new MinHeap();
9 q.add( new WorkOrder( 3 , ÐShampoo
carpetsÑ ));
10 q.add( new WorkOrder( 7 , ÐEmpty trashÑ ));
11 q.add( new WorkOrder( 8 , ÐWater plantsÑ ));
12 q.add( new WorkOrder( 10 , ÐRemove pencil
sharpener shavingsÑ ));
13 q.add( new WorkOrder( 6 , ÐReplace light
bulbÑ ));
14 q.add( new WorkOrder( 1 , ÐFix broken
sinkÑ ));
15 q.add( new WorkOrder( 9 , ÐClean coffee
makerÑ ));
16 q.add( new WorkOrder( 2 , ÐOrder cleaning
suppliesÑ ));
17
18 while (q.size() > 0 )
19 System.out.println(q.remove());
20 }
21 }

749
750

ch16/pqueue/WorkOrder.java

1 /**