C语言设计迷宫，找到所有路径及最短路径

#include#include#defineN19#defineN28#defineTN1*N2#defineM4charB[N1+1][N2+1];intcount=0;//记录路径条数typedefstructnode1{inta1;inta2;}find,direct[M+1];typedefstruct{intb1;intb2;intid;}site;typedefstruct//顺序栈{siteht[T];inttop;}Stack;voidPush(Stac