CS 112
Lecture 25
More on Graphs and Graph Traversal:
Prefix and Postfix visiting of nodes during DFS
Breadth-First Search (BFS)
- Prefix and postfix visiting of nodes during DFS.
- Breadth-First Search (BFS).
This material will be on the self-scheduled exam.
Ileana Streinu