迷宫遍历的简单算法程序c语言版

#include<stdio.h>   
  const   a[10][10]={   
    {0,0,0,0,0,0,0,0,0,0},   
    {0,0,1,1,0,0,0,0,1,0},   
    {0,1,1,0,0,1,1,1,1,0},   
    {0,0,1,0,1,1,0,1,1,0},   
    {0,0,0,0,0,1,1,1,1,0},   
    {0,0,1,0,0,0,0,0,1,0},   
    {0,1,1,1,1,0,0,0,1,0},   
    {0,1,1,1,1,0,0,0,1,0},   
    {0,0,0,0,1,1,1,1,1,0},   
    {0,0,0,0,0,0,0,0,0,0},   
    };   
  const   v[4]={0,1,0,-1};   
  const   h[4]={1,0,-1,0};   
  short   f[10][10]={0};   
  short   mark[10][10]={0};   
  struct   point{   
              int   x,y;   
              
  }way[64]={0}£¬best_xy[64];;   
  int   best;   
    
    
    
      void   search(int   ii,int   jj,int   current)   
      {   int   i,j,k,p;   
      way[current].x=ii;   
      way[current].y=jj;   
      mark[ii][jj]=1;