|
| Homework 7DetailsThe following problems are from pages 184-189 of ADM
| Problem | Notes
|
|---|
| 5-1 | Show your work. In particular, details about the BFS/DFS tree should be given (e.g. parent pointers or the tree drawn on the graph) along with any relevant numbers (e.g. distances and/or timestamps). Essentially, show enough to demonstrate that you actually followed the algorithms.
| | 5-3 | This problem is talking about acyclic graphs, not rooted trees.
| | 5-21 | Explain the idea behind your algorithm and justify its complexity. If you use BFS, specify what additional data you need to keep track of and what to do in one or more of the "process" methods of BFS. You will implement this algorithm for Homework 9. Feel free to do so now as a way of testing your algorithm. |
|