Programming assignment 4, due Monday, May 17, 10AM.

--------------- finding distances from a start vertex ----

Instructions:

1. Look at some sample mazes (in text format) such as ./Mazes/maze_010.txt .

2. Look at some sample solutions (in text format) such as ./Mazes/soln_maze_010.txt .

3. The ./Include directory is the same as for assignment 3.

4. Your assignment is to complete the file ./find_distances.cc .
In that file, you will need to finish the function find_distances().
Given a maze (and a corresponding graph), this routine must find the
distance (length of shortest path) from the start vertex to each vertex.

5. When you complete step 4, run "make" to compile find_distances,
then run "make test" to test it.  Your solutions should look identical
to those in the corresponding Mazes/soln_* files.

6. Turn in the single file find_distance.cc.  If you want, you can
also turn in any of the class definition files in ./Include that you
modify.