Update all-ancestors-of-a-node-in-a-directed-acyclic-graph.py

Author: kamyu104

Python/all-ancestors-of-a-node-in-a-directed-acyclic-graph.py

@@ -1,5 +1,5 @@
 # Time:  O(|V| * |E|)
-# Space: O(|V| * |E|)
+# Space: O(|V| + |E|)
 
 # dfs
 class Solution(object):
@@ -31,7 +31,7 @@ def iter_dfs(adj, i, result):
 
 
 # Time:  O(|V| * |E| * log(|V| * |E|))
-# Space: O(|V| * |E|)
+# Space: O(|V| + |E|)
 # bfs
 class Solution2(object):
     def getAncestors(self, n, edges):
@@ -66,7 +66,7 @@ def bfs(adj, i, result):
 
 
 # Time:  O(|V| * |E| * log(|V| * |E|))
-# Space: O(|V| * |E|)
+# Space: O(|V| + |E|)
 # topological sort
 class Solution3(object):
     def getAncestors(self, n, edges):