Fixing complexity in DFS and BFS

kopiro · kopiro · commit eaa01b6b3cc2 · 2017-06-04T13:25:14.000+02:00
diff --git a/algorithm/graph_search/bfs/desc.json b/algorithm/graph_search/bfs/desc.json
@@ -10,7 +10,7 @@
     "Construction of the failure function of the Aho-Corasick pattern matcher."
   ],
   "Complexity": {
-    "time": "worst $O(|E|)$",
+    "time": "worst $O(|V|+|E|)$",
     "space": "worst $O(|V|)$"
   },
   "References": [
diff --git a/algorithm/graph_search/dfs/desc.json b/algorithm/graph_search/dfs/desc.json
@@ -14,7 +14,7 @@
     "Finding biconnectivity in graphs."
   ],
   "Complexity": {
-    "time": "worst $O(|E|)$",
+    "time": "worst $O(|V|+|E|)$",
     "space": "worst $O(|V|)$"
   },
   "References": [
