C#深度優先搜索演算法demo

//論文要用到其改進演算法，在此先demo測試一下
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace DFS
{
    class Program
    {
        public int[,] map = new int[100, 100];
        public int[] road = new int[120];
        public int n, x, y;
        public int m = 1;
        public int[] visited = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, };
        static void Main(string[] args)
        {
            Program pro = new DFS.Program();
            int i, j;
            pro.n = int.Parse(Console.ReadLine());
            pro.x= int.Parse(Console.ReadLine());
            pro.y= int.Parse(Console.ReadLine());
        
            for (i = 0; i < pro.n; i++)
            {
                for (j = 0; j < pro.n; j++)
                {
                    pro.map[i,j]= int.Parse(Console.ReadLine());
                }
            }
            pro.road[0] = pro.x;
            pro.dfs(pro.x);
        }
        public void dfs(int p)
        {
            visited[p] = 1;
            int i, j;
            for (i = 0; i < n; i++)
            {
                if (map[p,i] == 1 && visited[i] == 0)
                {
                    if (i == y)///如果深搜到了終點，就輸出剛纔經過的路徑  
                    {
                        for (j = 0; j < m; j++)
                        {
                            Console.WriteLine("{0}", road[j]);
                        }
                        Console.WriteLine("{0}\r\n", y);
                    }
                    else///如果該點不是終點  
                    {
                        map[p,i] = 0;
                        road[m] = i;///將該點存起來  
                        m++;
                        dfs(i);///接著深搜  
                        map[p,i] = 1;
                        visited[i] = 0;
                        m--;
                    }
                }
            }
        }
    }
}