Add notes for BFS as well

2026-07-21 16:05:00 -04:00
parent 42a3430627
commit 95544077bc
3 changed files with 19 additions and 10 deletions
--- a/notes-and-examples/2026.07.21/depth-first-search.md
+++ b/notes-and-examples/2026.07.21/depth-first-search.md
@@ -40,13 +40,7 @@ What about this one?

 Based on these examples, can we create a formal algorithm that takes a starting node, producing a valid traversal path for all three graphs?

-An example for this graph:
+Some starter questions:

-```
-    0 --- 1
-    |     |
-    3 --- 2
-```
-
- Arguments: starting node `0`
- Expected output: 
+- Could recursion help us here?
+- What are some ways we can track already-visited nodes? What's the most *time-efficient* way to do so?