#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/depth-first-search-dfs/number-of-provinces-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/depth-first-search-dfs/number-of-provinces-implementation

Repovive

LeetCode 547 Number of Provinces - Implementation - Depth First Search (DFS) | Graph Theory | Repovive

Repovive.

Graph Theory37 sections · 1633 units81h total

Open in Course

LeetCode 547 Number of Provinces - Implementation

The Code

Here is the solution:

function dfs(u, matrix):
    visited[u] = true
    for v from 0 to n - 1:
        if matrix[u][v] == 1 and not visited[v]:
            dfs(v, matrix)

function findCircleNum(isConnected):
    n = isConnected.length
    visited = [false] * n
    provinces = 0

    for i from 0 to n - 1:
        if not visited[i]:
            provinces = provinces + 1
            dfs(i, isConnected)

    return provinces

This runs in $O(V + E)$ time and uses $O(V)$ space.