What is graph traversal in C++?

What is graph traversal in C++?

Graph traversal refers to the process of visiting all the nodes in a graph. In C++, common methods include Depth-First Search (DFS) and Breadth-First Search (BFS).

Can you explain how Depth-First Search works?

Sure! Depth-First Search explores as far as possible along each branch before backtracking. It uses a stack to remember the next vertex to visit.

How do I implement DFS in C++?

You can implement DFS using recursion or an explicit stack. Would you like to see a code example?

Yes, please provide a code example for DFS.

Here's a simple implementation of DFS in C++:

#include <iostream>
#include <vector>
using namespace std;

void DFS(int v, vector<bool> &visited, const vector<vector<int>> &graph) {
    visited[v] = true;
    cout << v << " ";
    for (int i : graph[v]) {
        if (!visited[i]) {
            DFS(i, visited, graph);
        }
    }
}

int main() {
    vector<vector<int>> graph = {{1, 2}, {0, 3}, {0}, {1}};
    vector<bool> visited(graph.size(), false);
    DFS(0, visited, graph);
    return 0;
}

This code performs DFS starting from vertex 0.