BFS 一開始想成拓墣錯了
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int test;
int n,m;
vector<int\> mz\[1005\];
bool vis\[1005\];
vector<int\> f;
int v\[1005\];
void bfs(){
queue<int\> q;
q.push(0);
while(!q.empty()){
int x=q.front();q.pop();
FOR(it,mz\[x\]){
int y=(\*it);
if(v\[y\]>v\[x\]+1){
v\[y\]=v\[x\]+1;
q.push(y);
}
}
}
}
void solve(){
Set(vis,0);
fill(&v\[0\],&v\[1004\],oo);
v\[0\]=0;
f.clear();
bfs();
for(int i=1;i<n;i++){
printf("%d\\n",v\[i\]);
}
}
void init(){
for(int i=0;i<1005;i++){
mz\[i\].clear();
}
}
int main() {
ios\_base::sync\_with\_stdio(0);
scanf("%d",&test);
while(test--){
init();
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int x,y;
scanf("%d%d",&x,&y);
if(x==0)mz\[x\].PB(y);
else if(y==0)mz\[y\].PB(x);
else{
mz\[x\].PB(y);
mz\[y\].PB(x);
}
}
solve();if(test)Pln();
}
}