Rushing Through

Tried to see if I could cover all the graph algorithms in one meeting. Covered Krsukal's, Prim's, Dijkstra's, Floyd-Warshall's, and some Matrix Multiplication. And started late, too. Will have to review Bellman-Ford's, DAG and Johnson's, probably cover those next meeting, probably before the SW 4. Whew.