brendan/dsa-tutoring
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add more assignment details

Browse Source
This commit is contained in:
Brendan Chen
2026-07-21 16:09:18 -04:00
parent 95544077bc
commit d488ac5575
1 changed files with 7 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
notes-and-examples/2026.07.21/overview.md
View File

@@ -2,4 +2,10 @@
To make our knowledge of graphs useful, we'll go over our first traversal method today: [depth-first search](./depth-first-search.md). We will also go over [breadth-first search](./breadth-first-search.md), and how both algorithms can be useful. To make our knowledge of graphs useful, we'll go over our first traversal method today: [depth-first search](./depth-first-search.md). We will also go over [breadth-first search](./breadth-first-search.md), and how both algorithms can be useful.
Assignment: finish the code for depth-first search, and also implement breadth-first search. Assignment: write functions for depth-first search and breadth-first search. Because there is no starter file, the constraints are listed below:
- You may use either an adjacency list or adjacency matrix to represent your graph
- You should demonstrate that your algorithm works by running it through some test cases
- For each test case, specify the graph, starting point, and expected output(s)
Bonus: can you output *all* the valid paths for both DFS and BFS in a particular case?