深度优先和广度优先的基础应用

        int[,] ditu = new int[5, 4]{
                {0,0,1,0},
                {0,0,0,0},
                {0,0,1,0},
                {0,1,0,0},
                {0,0,0,1}
            };
        int[,] book_1 = new int[5, 4];

        int[,] fanxiang = new int[4, 2] {
            {0,1},//右边
            {1,0},//下边
            {0,-1},//左边
            {-1,0}//上边
        };

        private void dyzdlj(int x, int y, int step)
        {
            if (x == 3 && y == 2)
            {
                if (step < min)
                {
                    min = step;
                }
                Console.WriteLine("我找到了一种走的方法了,一共走了{0}步", step);
                return;
            }
            for (int i = 0; i < 4; i++)
            {
                //走
                int tx = x + fanxiang[i, 0];
                int ty = y + fanxiang[i, 1];
                //判断是否越界
                if (tx < 0 || ty < 0 || tx > 4 || ty > 3)
                {
                    continue;
                }
                if (book_1[tx, ty] == 0 && ditu[tx, ty] == 0)
                {
                    book_1[tx, ty] = 1;
                    dyzdlj(tx, ty, step + 1);
                    book_1[tx, ty] = 0;
                }
            }
        }

    public struct node
    {
        public int x;//x坐标
        public int y;//y坐标
        public int s;//步数
    }

        private void gdyxsf()
        {
            node[] nn = new node[20];
            int head = 0, tail = 0;
            //设置起点
            nn[head].x = 0;
            nn[head].y = 0;
            nn[head].s = 0;
            book_1[0, 0] = 1;
            tail++;
            int flag = 0;
            while (head<tail)
            {
                
                for (int i = 0; i < 4; i++)
                {
                    int tx =nn[head].x+fanxiang[i, 0];
                    int ty = nn[head].y + fanxiang[i, 1];
                    if (tx<0||ty<0||tx>4||ty>3)
                    {
                        continue;
                    }
                    //判断地图是否被走过
                    if (ditu[tx,ty]==0&&book_1[tx,ty]==0)
                    {
                        book_1[tx, ty] = 1;
                        nn[tail].x = tx;
                        nn[tail].y = ty;
                        nn[tail].s = nn[head].s + 1;
                        tail++;
                    }
                    if (book_1[3,2]==1)
                    {
                        flag = 1;
                        break;
                    }
                }
                if (flag==1)
                {
                    Console.WriteLine("我已经到了这个地方了,我一共走了{0}步", nn[tail - 1].s);
                    break;
                }
                head++;
            }
        }