How do I implement graph traversal in C?

How do I implement graph traversal in C?

You can implement graph traversal in C using Depth-First Search (DFS) or Breadth-First Search (BFS). Which one would you like to know more about?

Can you explain Depth-First Search?

Sure! DFS explores as far as possible along each branch before backtracking. You can implement it using recursion or a stack.

What does the code look like for DFS?

Here's a simple implementation of DFS in C:

void DFS(int graph[MAX][MAX], int visited[], int node, int n) {
    visited[node] = 1;
    printf("%d ", node);
    for (int i = 0; i < n; i++) {
        if (graph[node][i] == 1 && !visited[i]) {
            DFS(graph, visited, i, n);
        }
    }
}

This function takes a graph represented as an adjacency matrix, a visited array, the current node, and the number of nodes.

What about Breadth-First Search?

BFS explores all neighbors at the present depth prior to moving on to nodes at the next depth level. It uses a queue for implementation.