C语言迷宫(经典题目).docx

在上面的迷宫中只有一个入口，有地方是有食物的，现在一只老鼠从入口处进来，要求能找到所有的食物并且打印找到食物的路径。(1)图信息：#define N 8struct ginfoint up,down,left,right;int food,visit; aNN=; (2)记录路径pathN*N;(3)找到食物axy.food=1(4)代码#include stdio.h #include#define N 8int path64,k=0;struct ginfoint up,down,left,right;int food,visit; aNN=0,0,0,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 0,1,1,0,0,0,0,0,0,1,0,0, 0,0,1,1,0,0, 1,0,1,1,0,0, 0,1,1,0,0,0, 0,1,0,0,0,0, 1,1,0,1,0,0, 0,1,1,0,0,0, 1,1,0,0,0,0,0,1,0,0,0,0, 0,1,0,0,0,0, 0,1,0,0,1,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0,1,1,0,0,0,0, 1,1,0,1,0,0, 1,1,1,0,0,0, 1,1,0,1,0,0, 1,0,1,1,0,0, 1,0,1,0,0,0, 1,0,0,0,1,0, 1,1,0,0,0,0,1,1,0,1,0,0, 1,1,1,0,0,0, 1,1,0,0,0,0, 1,0,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,1,1,0,0,0,1,0,0,0,0,0, 1,0,0,0,0,0, 1,1,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0,0,1,0,1,0,0, 0,0,1,1,0,0, 1,0,1,1,0,0, 0,1,1,1,0,0, 0,1,1,1,0,0, 1,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,0,0,0,1,0,0,1,1,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0, 1,0,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0;void print()int i,x=0,y=0;printf(0,0-);for(i=1;i=k;i+)switch(pathi)case 1 :x-;break; case 2 :x+;break; case 3 :y-;break; case 4 :y+;break; if(i,x,y);else printf(%d,%d found!n,x,y);void try1(int x,int y)axy.visit=1;if(axy.food) axy.food=0;print();k+;if(axy.up) pathk=1;/方向为1x-;axy.down=0;if(!axy.visit)try1(x,y);axy.down=1;x+;if(axy.down) pathk=2;/方向为2x+;axy.up=0;if(!axy.visit)try1(x,y);axy.up=1;x-;if(axy.left) pathk=3;/方向为3y-;axy.right=0;if(!axy.visit)try1(x,y);axy.right=1;y+;if(axy.right) pathk=4;/方向为4y+;axy.left=0;if(!axy.visit)try1(x,y);axy.left=1;y-;axy.visit=0;k-;void main() try1(0,0); 深层次问题：找发现食物的更短路。#include stdio.h #include#define N 8int path64,k=0;int fNN=0;struct ginfoint up,down,left,right;int food,visit; aNN=0,0,0,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 0,1,1,0,0,0,0,0,0,1,0,0, 0,0,1,1,0,0, 1,0,1,1,0,0, 0,1,1,0,0,0, 0,1,0,0,0,0, 1,1,0,1,0,0, 0,1,1,0,0,0, 1,1,0,0,0,0,0,1,0,0,0,0, 0,1,0,0,0,0, 0,1,0,0,1,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0,1,1,0,0,0,0, 1,1,0,1,0,0, 1,1,1,0,0,0, 1,1,0,1,0,0, 1,0,1,1,0,0, 1,0,1,0,0,0, 1,0,0,0,1,0, 1,1,0,0,0,0,1,1,0,1,0,0, 1,1,1,0,0,0, 1,1,0,0,0,0, 1,0,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,1,1,0,0,0,1,0,0,0,0,0, 1,0,0,0,0,0, 1,1,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0,0,1,0,1,0,0, 0,0,1,1,0,0, 1,0,1,1,0,0, 0,1,1,1,0,0, 0,1,1,1,0,0, 1,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,0,0,0,1,0,0,1,1,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0, 1,0,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0;void print()int i,x=0,y=0;printf(n0,0 - );for(i=1;i=k;i+)switch(pathi)case 1 :x-;break; case 2 :x+;break; case 3 :y-;break; case 4 :y+;break; if(i ,x,y);else printf(%d,%d food!n,x,y);void try1(int x,int y)axy.visit=1;if(axy.food & !fxy) fxy=k;print();/axy.food=0;if(axy.food & fxyk)fxy=k;printf(nFound a shortest one ); print();k+;if(axy.up) pathk=1;/方向为1x-;axy.down=0;if(!axy.visit)try1(x,y);axy.down=1;x+;if(axy.down) pathk=2;/方向为2x+;axy.up=0;if(!axy.visit)try1(x,y);axy.up=1;x-;if(axy.left) pathk=3;/方向为3y-;axy.right=0;if(!axy.visit)try1(x,y);axy.right=1;y+;if(axy.right) pathk=4;/方向为4y+;axy.left=0;if(!axy.visit)try1(x,y);axy.left=1;y-;axy.visit=0;k-;void main() try1(0,0); 最深层次问题：找发现食物的最短路。#include stdio.h #include stdlib.h #include#define N 8int path64,k=0;struct ginfoint up,down,left,right;int food,visit; aNN=0,0,0,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 0,1,1,0,0,0,0,0,0,1,0,0, 0,0,1,1,0,0, 1,0,1,1,0,0, 0,1,1,0,0,0, 0,1,0,0,0,0, 1,1,0,1,0,0, 0,1,1,0,0,0, 1,1,0,0,0,0,0,1,0,0,0,0, 0,1,0,0,0,0, 0,1,0,0,1,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0, 1,1,0,0,0,0,1,1,0,0,0,0, 1,1,0,1,0,0, 1,1,1,0,0,0, 1,1,0,1,0,0, 1,0,1,1,0,0, 1,0,1,0,0,0, 1,0,0,0,1,0, 1,1,0,0,0,0,1,1,0,1,0,0, 1,1,1,0,0,0, 1,1,0,0,0,0, 1,0,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,1,1,0,0,0,1,0,0,0,0,0, 1,0,0,0,0,0, 1,1,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0,0,1,0,1,0,0, 0,0,1,1,0,0, 1,0,1,1,0,0, 0,1,1,1,0,0, 0,1,1,1,0,0, 1,0,1,1,0,0, 0,0,1,1,0,0, 0,1,1,0,0,0,1,0,0,1,1,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0, 1,0,0,1,0,0, 0,0,1,1,0,0, 0,0,1,1,0,0, 1,0,1,0,0,0;typedef struct pathNodeint x,y,k;int *r;struct pathNode * next;foodRoad;foodRoad * head;foodRoad * searchPath(int x,int y)foodRoad * p=head;while(p)if(p-x = x & p-y = y) return p;p=p-next; return 0;void createHead()head=(foodRoad *)malloc(sizeof(foodRoad);head-next=0;void createPathNode(int x,int y,int k)int i,*pr;foodRoad *p;p=searchPath(x,y);if(p=0)foodRoad *pf;pf=(foodRoad *)malloc(sizeof(foodRoad);pf-x=x;pf-y=y;pf-k=k;pr=(int *)malloc(sizeof(int)*(k+1);pf-r=pr;for(i=1;inext=0;p=head;while(p-next)p=p-next;p-next=pf;else if(p-k k)free(p-r);pr=(int *)malloc(sizeof(int)*(k+1);p-r=pr;p-k=k;for(i=1;inext;int i,x,y,k;while(p)x=0,y=0,k=p-k;printf(n0,0 - );for(i=1;iri)case 1 :x-;break; case 2 :x+;break; case 3 :y-;break; case 4 :y+;break; if(i ,x,y);else printf(%d,%d food!n,x,y);p=p-next;void try1(int x,int y)axy.visit=1;if(axy.food) createPathNode(x,y,k);k+;if(axy.up) pathk=1;/方向为1x-;axy.down=0;if(!axy.visit)try1(x,y);axy.down=1;x+;if(axy.down) pa