edit : correct #261 code comments

DaleStudy · Oct 21, 2024 · e9629f7 · e9629f7
1 parent ac155d9
commit e9629f7
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/course-schedule/EGON.py b/course-schedule/EGON.py
@@ -17,10 +17,10 @@ def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:
 
     Memory: 17.85 MB (Beats 99.94%)
     Space Complexity: O(c)
-        - graph 변수 사용에 O(c)
+        - graph 변수 사용에 O(c + p)
         - rank 변수 사용에 O(c)
         - queue 변수 사용에서 최대 크기는 graph의 크기와 같으므로 O(c)
-        > O(c) + O(c) + O(c) ~= O(c)
+        > O(c + p) + O(c) + O(c) ~= O(c + p)
     """
     def solve_topological_sort(self, numCourses: int, prerequisites: List[List[int]]) -> bool:
         graph = {i: [] for i in range(numCourses)}