如何使用c找到DFS中的组件数量？

#include <stdio.h>
#include <stdbool.h>

#define MAX_VERTICES 100

// 图的邻接表结构
typedef struct Node {
    int vertex;
    struct Node* next;
} Node;

typedef struct Graph {
    Node* adjList[MAX_VERTICES];
    bool visited[MAX_VERTICES];
} Graph;

// 初始化图
void initGraph(Graph* graph, int numVertices) {
    for (int i = 0; i < numVertices; i++) {
        graph->adjList[i] = NULL;
        graph->visited[i] = false;
    }
}

// 添加边
void addEdge(Graph* graph, int src, int dest) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->vertex = dest;
    newNode->next = graph->adjList[src];
    graph->adjList[src] = newNode;

    newNode = (Node*)malloc(sizeof(Node));
    newNode->vertex = src;
    newNode->next = graph->adjList[dest];
    graph->adjList[dest] = newNode;
}

// DFS函数
void DFS(Graph* graph, int vertex) {
    graph->visited[vertex] = true;
    Node* adjNode = graph->adjList[vertex];
    while (adjNode != NULL) {
        int adjVertex = adjNode->vertex;
        if (!graph->visited[adjVertex]) {
            DFS(graph, adjVertex);
        }
        adjNode = adjNode->next;
    }
}

// 计算组件数量
int countComponents(Graph* graph, int numVertices) {
    int count = 0;
    for (int i = 0; i < numVertices; i++) {
        if (!graph->visited[i]) {
            DFS(graph, i);
            count++;
        }
    }
    return count;
}

int main() {
    Graph graph;
    int numVertices = 6;
    initGraph(&graph, numVertices);

    addEdge(&graph, 0, 1);
    addEdge(&graph, 0, 2);
    addEdge(&graph, 1, 2);
    addEdge(&graph, 3, 4);

    int components = countComponents(&graph, numVertices);
    printf("Number of components: %d\n", components);

    return 0;
}