From d055b297a52ae2b7164b86c311f98b703db6dac8 Mon Sep 17 00:00:00 2001
From: lshprung <lshprung@yahoo.com>
Date: Mon, 1 Jun 2020 11:52:21 -0700
Subject: Post-class 06/01

---
 05-29.md | 4 ++++
 1 file changed, 4 insertions(+)

(limited to '05-29.md')

diff --git a/05-29.md b/05-29.md
index e67f90c..a74f8b4 100644
--- a/05-29.md
+++ b/05-29.md
@@ -322,3 +322,7 @@ void visit(n){
 	- How many times? That depends on how many edges lead to it
 	- Although we print out each node only once, we must examine every edge in the graph
 	- So, the complexity of DFS and BFS is O(V+E). (The V comes from the face that we have to initially unmark all vertices before we start a search)
+
+---
+
+[06/01 ->](06-01.md)
-- 
cgit