Problem_2_Number_Of_Provinces.java

package Graph;

// Problem Statement: Number of Provinces (medium)
// LeetCode Question: 547. Number of Provinces

public class Problem_2_Number_Of_Provinces {

    public int findCircleNum(int[][] isConnected){
        int provinces = 0;
        int n = isConnected.length;
        boolean[] visited = new boolean[n];
        for (int i = 0; i < n; i++) {
            if (!visited[i]) {
                dfs(isConnected, visited, i);
                provinces++;
            }
        }
        return provinces;
    }

    private void dfs(int[][] isConnected, boolean[] visited, int i){
        for (int j = 0; j < isConnected.length; j++) {
            if (isConnected[i][j] == 1 && !visited[j]) {
                visited[j] = true;
                dfs(isConnected, visited, j);
            }
        }
    }
}