Next: November 7
Up: November lecture summary
Previous: November 4
November 5
- Continue Graphs, Part
I
- Advantages of each graph representation
- Complexity of some operations in each representation
- Begin Graphs, Part
II
- Graph traversals: BFS and DFS (generic traversal algorithm)
- Recursive DFS.
Danny Heap
2002-12-13