数据结构老鼠迷宫VC源程序6页.doc

#include#include#include#define for if(0);else for#define max 300char mapmaxmax;int cross,vertical;/老鼠的横纵坐标int time;typedef struct int x,y;int step;point;point s;point queue100*max;int amaxmax;int dx4=0,1,0,-1;int dy4=1,0,-1,0;int value_place(point tmp, int i, int row, int col) if(tmp.x+dxi=0 & tmp.x+dxi=0 & tmp.y+dyicol & maptmp.x+dxitmp.y+dyi!=*& a