[Python手撕]连通分量的数量（bfs，dfs）

class Solution:
    def findCircleNum(self, isConnected: List[List[int]]) -> int:

        n = len(isConnected)
        visited = [0]*n 
        count = 0

        def bfs(start):
            queue = [start]
            while queue:
                t = queue.pop(0)
                visited[t] = 1
                for x in range(n):
                    if isConnected[t][x] == 1 and visited[x] == 0:
                        queue.append(x)


        for i in range(n):
            if visited[i] == 0:
                count += 1
                bfs(i)

        return count

class Solution:
    def findCircleNum(self, isConnected: List[List[int]]) -> int:

        n = len(isConnected)
        visited = [0]*n 
        count = 0

        def dfs(start):
            if visited[start] == 0:
                visited[start] = 1
            for i in range(n):
                if isConnected[start][i] == 1 and visited[i] == 0:
                    dfs(i)


        for i in range(n):
            if visited[i] == 0:
                count += 1
                dfs(i)

        return count