Fix count of areas with dfs snippet in graph week_12

Author: TeogopK

Seminars/sem_12/playground_12.ipynb

@@ -452,6 +452,8 @@
     "    for vertex in graph:\n",
     "        if vertex in visited:\n",
     "            continue\n",
+    "        visited.add(vertex)\n",
+    "        \n",
     "        dfs(vertex, visited, graph)\n",
     "        count += 1\n",
     "\n",

Tasks/tasks_12/count_of_areas/solution_dfs_recursive.py

@@ -1,7 +1,7 @@
 """Solution using DFS with recursion."""
 
 import sys
-sys.setrecursionlimit(100_000)
+sys.setrecursionlimit(int(1e5))
 
 def dfs(current, visited, graph):
     for neighbor in graph[current]:
@@ -17,7 +17,10 @@ def count_areas(graph):
     for vertex in graph:
         if vertex in visited:
             continue
+
+        visited.add(vertex)
         dfs(vertex, visited, graph)
+        
         count += 1
 
     return count
@@ -35,5 +38,3 @@ def count_areas(graph):
         graph[y].add(x)
 
     print(count_areas(graph), end=' ')
-        
-