Lab 4

To Do:

This lab we will write 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).

Due on Monday we will add some more algorithms to the code.

Dijkstra's Algorithm
Prim's Algorithm
Floyd's and
Warsall's

We went over the algorithms in class yesterday and today.

Turn in

Get as much done as you can today. If you get Dijkstra's and Prim's done today you can leave, if not we'll work until 1pm.