Homework 4
Assigned Nov 11th
Due: Nov 25th
The problem:
1. Implement a real number binary min Heap ADT class using C++
You need to have the following functions related to the Heap class.
• Insert(x, l): add an element x with label l (label is introduced for look up purpose).
• DeleteMin(): delete the minimal element in the heap and return it
• ConstructHeap(Vector<real> X, Vector<string> L): using a set of elements to
construct a (initially empty) binary heap.
• Update(x,l): update the value of label l.
• Size(): return the number of elements in the heap
• isEmpty(): return true if the heap contains no element and false, otherwise.
• Print(): print out the elements of the heap in the order of the array entry of the
elements
You code should not assume that the maximal number of elements that can be inserted
into a heap. Basic error handling should be there.
2. Based on YOUR heap class, implementing the dijkstra's algorithm for computing the
single source shortest path problem for directed (non-negatively) weighted graphs. You
should implement a function
• computeDistance(X): X is the index of the source node and computes the
distances from X to all nodes in a graph.
How to test your code:
You should name your executables as “hadt” for the heap ADT class, “sssp” for the
dijkstra’s algorithm.
For the heap class executable hadt, it should accept an in-line parameter, which is the
name of the testing file. For example, to run hadt, you should type:
$hadt htest
where htest is a testing file. You do not necessary name your test file as htest.
The testing file for the heap ADT class is a set of commands, one at each line. Each
command is composed of the name of the related function and the related parameters
(without parenthesis and comma, with the exception of the ConstructHeap function). For
the ConstructHeap function, you should provide a set of real numbers and their labels.
The values (real numbers) and the labels should be separated by a single comma. There
can only be one ConstructHeap function and that function must be the first command in
the test file. For example the following is a valid testing file for the heap class:
ConstructHeap 0 1.1 3.0 -2.0, A B C D
