How can I detect cycles in a graph using C#?

How can I detect cycles in a graph using C#?

You can use Depth-First Search (DFS) to detect cycles in a graph. Would you like a code example?

Yes, please provide a code example for cycle detection.

Here's a simple implementation using DFS:

public class Graph {
    private int V; // Number of vertices
    private List<int>[] adj; // Adjacency list

    public Graph(int v) {
        V = v;
        adj = new List<int>[v];
        for (int i = 0; i < v; i++)
            adj[i] = new List<int>();
    }

    public void AddEdge(int v, int w) {
        adj[v].Add(w);
    }

    private bool IsCyclicUtil(int v, bool[] visited, bool[] recStack) {
        if (recStack[v]) return true;
        if (visited[v]) return false;

        visited[v] = true;
        recStack[v] = true;

        foreach (var neighbor in adj[v]) {
            if (IsCyclicUtil(neighbor, visited, recStack))
                return true;
        }

        recStack[v] = false;
        return false;
    }

    public bool IsCyclic() {
        bool[] visited = new bool[V];
        bool[] recStack = new bool[V];

        for (int i = 0; i < V; i++) {
            if (IsCyclicUtil(i, visited, recStack))
                return true;
        }
        return false;
    }
}

This code defines a graph and checks for cycles.

What if my graph is directed? Does this method still work?

Yes, this method works for directed graphs as well. The DFS approach is effective for both types of graphs.