摘要：
fro < re 然后用结构体记录上一步的步数。View Code 图结构练习——BFS——从起始点到目标点的最短步数#include<stdio.h>#include<string.h>int map[1005][1005];struct node{ int i; int count;} q[2005];int pro[1005];int fro;int re;int main(){ int d,e,s,i,j,a,b,t; while(scanf("%d %d",&d,&e) != EOF) { memset(map,0,s 阅读全文
摘要：
View Code #include<stdio.h>#include<string.h>int map[105][105];int q[210];int pro[105];int fro;int re;int main(){ int d,e,s,i,j,a,b,t; scanf("%d",&t); while(t--) { memset(map,0,sizeof(map)); memset(pro,0,sizeof(pro)); scanf("%d %d %d",&d,&e,&s); for(i 阅读全文