Add task1 exam_06 solutions

Author: TeogopK

Exams/exam_06/task1/solution_bfs.py

@@ -0,0 +1,43 @@
+from collections import deque
+
+def bfs(starting_vertex, num_traversal, parents, visited, graph):
+    q = deque([starting_vertex])
+
+    while q:
+        current = q.popleft()
+        parents[current] = num_traversal
+
+        for neighbor in graph[current]:
+            if neighbor not in visited:
+                visited.add(neighbor)
+                q.append(neighbor)
+
+                
+def count_areas(V, graph):
+    parents = [v for v in range(V + 1)]
+    num_traversal = 0
+    visited = set()
+
+    for vertex in graph:
+        if vertex in visited:
+            continue
+        bfs(vertex, num_traversal, parents, visited, graph)
+        num_traversal += 1
+
+    return parents
+
+N, M = map(int, input().split())
+graph = {v:set() for v in range(1, N + 1)}
+
+for _ in range(M):
+    x, y = map(int, input().split())
+    graph[x].add(y)
+    graph[y].add(x)
+    
+Q = int(input())
+queries = (tuple(map(int, input().split())) for _ in range(Q))
+
+parents = count_areas(N, graph)
+
+for x, y in queries:
+    print(1 if parents[x] == parents[y] else 0, end = ' ')

Exams/exam_06/task1/solution_dfs.py

@@ -0,0 +1,39 @@
+import sys
+sys.setrecursionlimit(1_000_000)
+
+def dfs(current, num_traversal, parents, visited, graph):
+    parents[current] = num_traversal
+    
+    for neighbor in graph[current]:
+        if neighbor not in visited:
+            visited.add(neighbor)
+            dfs(neighbor, num_traversal, parents,  visited, graph)
+
+def count_areas(V, graph):
+    parents = [v for v in range(V + 1)]
+    num_traversal = 0
+    visited = set()
+
+    for vertex in graph:
+        if vertex in visited:
+            continue
+        dfs(vertex, num_traversal, parents, visited, graph)
+        num_traversal += 1
+
+    return parents
+
+N, M = map(int, input().split())
+graph = {v:set() for v in range(1, N + 1)}
+
+for _ in range(M):
+    x, y = map(int, input().split())
+    graph[x].add(y)
+    graph[y].add(x)
+    
+Q = int(input())
+queries = (tuple(map(int, input().split())) for _ in range(Q))
+
+parents = count_areas(N, graph)
+
+for x, y in queries:
+    print(1 if parents[x] == parents[y] else 0, end = ' ')

Exams/exam_06/task1/solution_kruskal.py

@@ -0,0 +1,39 @@
+import sys
+sys.setrecursionlimit(1_000_000)
+
+def find(x, parents):
+    if parents[x] == x:
+        return x
+    
+    furthest_parent = find(parents[x], parents)
+    parents[x] = furthest_parent
+
+    return furthest_parent
+
+def union(x, y, parents, rank):
+    x_root = find(x, parents)
+    y_root = find(y, parents)
+
+    parents[x_root] = y_root
+
+N, M = map(int, input().split())
+edges = [map(int, input().split()) for _ in range(M)]
+    
+Q = int(input())
+queries = (tuple(map(int, input().split())) for _ in range(Q))
+
+def solve(V, edges, queries):
+    rank = [0] * (V + 1)
+    parents = [v for v in range(V + 1)]
+    
+    for x, y in edges:
+        union(x, y, parents, rank)
+        
+    for x, y in queries:
+        is_connected = find(x, parents) == find(y, parents)
+        
+        print(1 if is_connected else 0, end = ' ')
+
+    
+solve(N, edges, queries)
+