DFS

#include <stdio.h>

#define V 5  // Number of vertices

int graph[V][V] = {
    {0, 1, 1, 0, 0},
    {1, 0, 0, 1, 0},
    {1, 0, 0, 1, 1},
    {0, 1, 1, 0, 1},
    {0, 0, 1, 1, 0}
};

int visited[V]; // To track visited nodes

void DFS(int vertex) {
    printf("%d ", vertex);
    visited[vertex] = 1;

    for (int i = 0; i < V; i++) {
        if (graph[vertex][i] == 1 && !visited[i]) {
            DFS(i);
        }
    }
}

int main() {
    // Initialize visited array
    for (int i = 0; i < V; i++)
        visited[i] = 0;

    printf("DFS Traversal: ");
    DFS(0); // Start DFS from vertex 0

    return 0;
}