How can I implement graph traversal in C#?

How can I implement graph traversal in C#?

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

I'd like to learn about Depth-First Search.

Great choice! In DFS, you explore as far as possible along each branch before backtracking. Would you like a code example?

Yes, please provide a code example for DFS in C#.

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

using System;
using System.Collections.Generic;

class Graph {
    private Dictionary<int, List<int>> adjList = new Dictionary<int, List<int>>();

    public void AddEdge(int v, int w) {
        if (!adjList.ContainsKey(v)) adjList[v] = new List<int>();
        adjList[v].Add(w);
    }

    public void DFS(int start) {
        HashSet<int> visited = new HashSet<int>();
        DFSUtil(start, visited);
    }

    private void DFSUtil(int v, HashSet<int> visited) {
        visited.Add(v);
        Console.Write(v + " ");

        foreach (var neighbor in adjList[v]) {
            if (!visited.Contains(neighbor)) {
                DFSUtil(neighbor, visited);
            }
        }
    }
}

This code defines a graph and performs DFS starting from a given vertex.