Use the code available here to start
Follow the TAs as they guide you through the material and exercises in the notebook.
Implement recursive or iterative DFS (you don’t need to implement both)
Implement iterative BFS
Test your code on the simple directed-graph problem provided. What does this graph look like?
Test your code on the more complex undirected graph shown here
- Implement an algorithm to determine if a graph has cycles