Przejdź do treści

Spójne składowe

Opis problemu

Implementacja

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
from typing import List

def dfs(graph: List[List[int]], visited: List[bool], node: int):
    if visited[node]:
        return

    visited[node] = True

    for new_node in graph[node]:
        if not visited[new_node]:
            dfs(graph, visited, new_node)

def count_connected_components(graph: List[List[int]]) -> int:
    result = 0
    visited = [False] * len(graph)

    for node, vis in enumerate(visited):
        if not vis:
            result += 1
            dfs(graph, visited, node)

    return result

graph = [
    [1, 6],
    [0, 6, 3, 2],
    [1, 3],
    [2, 1, 6, 4, 5],
    [3, 5],
    [4, 3, 6],
    [0, 1, 3, 5]
]

result = count_connected_components(graph)

print("Number of connected components in the graph:", result)