K8uBF9 - Online C++ Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;

vector<int> adj_list[100];
int visited[100];

void DFS(int currnode) {
    visited[currnode] = 1;


        for (int i = 0; i < adj_list[currnode].size(); i++) {
            int child = adj_list[currnode][i];
            if (visited[child] == 0) {

                DFS(child);
            }
        }
    }


int main() {
    int node, edge;
    cin >> node >> edge;

    // Fix: Loop should run for edge times, not edge+1
    for (int i = 0; i < edge; i++) {
        int u, v;
        cin >> u >> v;
        adj_list[u].push_back(v);
        adj_list[v].push_back(u); // undirected
    }

    int components = 0;
    for (int i = 1; i <= node; i++) {
        if (visited[i] == 0) {
            DFS(i);
            components++;
        }
    }

    cout << "Total connected components: " << components << endl;

    return 0;
}