Lab 5

Due Monday morning before class

First we turned in the delete from an Red/Black Tree code

As soon as you turn it in I will reply with my code for deleting that seems to be working.

Next we completed Wednesday's work:

On Wednesday we went to the lab and wrote methods to do the following tasks:

Read in a graph
- Your program should read in a text file that has a adjacency matrix. You can assume the matrix will always be symmetrical. Example:
```
           01101
           10011
           10001
           01000
           11100
```
Write a method that does bread-first search (Queue).
Write a method that does depth-first search (recursion).

Today's lab we will use the algorithms in your book. You will add two algorithms to your code.

Dijkstra's Algorithm
Prim's Algorithm

We went over the algorithm for both in class.

Turn in

Email the code before class on Monday.