如何使用C#编写图搜索算法

class Graph
{
    int V; // 图的顶点数目
    List[] adj; // 存储邻接表
    
    public Graph(int v)
    {
        V = v;
        adj = new List[V];
        for (int i = 0; i < V; ++i)
        {
            adj[i] = new List();
        }
    }
    
    public void AddEdge(int v, int w)
    {
        adj[v].Add(w);
        adj[w].Add(v);
    }
    
    public void BFS(int s)
    {
        bool[] visited = new bool[V];
        Queue queue = new Queue();
        
        visited[s] = true;
        queue.Enqueue(s);
        
        while (queue.Count != 0)
        {
            s = queue.Dequeue();
            Console.Write(s + " ");
            
            foreach (int i in adj[s])
            {
                if (!visited[i])
                {
                    visited[i] = true;
                    queue.Enqueue(i);
                }
            }
        }
    }
}

class Program
{
    static void Main(string[] args)
    {
        Graph g = new Graph(4);
        
        g.AddEdge(0, 1);
        g.AddEdge(0, 2);
        g.AddEdge(1, 2);
        g.AddEdge(2, 0);
        g.AddEdge(2, 3);
        g.AddEdge(3, 3);
        
        Console.WriteLine("广度优先搜索结果为：");
        g.BFS(2);
    }
}