diff options
author | lshprung <lshprung@yahoo.com> | 2020-06-01 11:52:21 -0700 |
---|---|---|
committer | lshprung <lshprung@yahoo.com> | 2020-06-01 11:52:21 -0700 |
commit | d055b297a52ae2b7164b86c311f98b703db6dac8 (patch) | |
tree | 9f65318fc40ccf2ed967b7e3bf261804577d4e42 /05-29.md | |
parent | 902fd163c0f27a5e0966f9d86828b52a6518768d (diff) |
Post-class 06/01
Diffstat (limited to '05-29.md')
-rw-r--r-- | 05-29.md | 4 |
1 files changed, 4 insertions, 0 deletions
@@ -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) |