You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
#include<iostream> //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȱ<EFBFBD><C8B1><EFBFBD>
|
|
|
|
|
|
|
|
|
|
int main() {
|
|
|
|
|
int i,j,n,m, a, b, cur,book[101]= {0},e[101][101];
|
|
|
|
|
int que[10001],head,tail;
|
|
|
|
|
scanf("%d %d",&n,&m);
|
|
|
|
|
|
|
|
|
|
//<2F><>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD>ά<EFBFBD><CEAC><EFBFBD><EFBFBD>
|
|
|
|
|
for (i = 1; i <= m; ++i) {
|
|
|
|
|
for (int j = 1; j <= n; ++j) {
|
|
|
|
|
if (i == j)
|
|
|
|
|
e[i][j] = 0;
|
|
|
|
|
else
|
|
|
|
|
e[i][j] = 99999999; //<2F><><EFBFBD><EFBFBD>99999999Ϊ<39><CEAA><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
//<2F><><EFBFBD>붥<EFBFBD><EBB6A5>֮<EFBFBD><D6AE><EFBFBD>ı<EFBFBD>
|
|
|
|
|
for (i = 1; i <= m; ++i) { //<2F><><EFBFBD>붥<EFBFBD><EBB6A5><EFBFBD><EFBFBD><EFBFBD>ı<EFBFBD>
|
|
|
|
|
scanf("%d %d",&a,&b);
|
|
|
|
|
e[a][b] = 1;
|
|
|
|
|
e[b][a] = 1; //<2F><>Ϊ<EFBFBD><CEAA><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ
|
|
|
|
|
}
|
|
|
|
|
//<2F><><EFBFBD>г<EFBFBD>ʼ<EFBFBD><CABC>
|
|
|
|
|
head=1;
|
|
|
|
|
tail=1;
|
|
|
|
|
//<2F><>1<EFBFBD>Ŷ<EFBFBD><C5B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>,<2C><>1<EFBFBD>Ŷ<EFBFBD><C5B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
que[tail]=1;
|
|
|
|
|
tail++;
|
|
|
|
|
book[1]=1;
|
|
|
|
|
//<2F><><EFBFBD><EFBFBD><EFBFBD>в<EFBFBD>Ϊ<EFBFBD>յ<EFBFBD>ʱ<EFBFBD><CAB1>ѭ<EFBFBD><D1AD>
|
|
|
|
|
while (head<tail && tail<=n) {
|
|
|
|
|
cur=que[head];
|
|
|
|
|
for (i = 1; i <= n; ++i) {
|
|
|
|
|
if (e[cur][i] == 1 && book[i] == 0) {
|
|
|
|
|
que[tail]=i;
|
|
|
|
|
tail++;
|
|
|
|
|
book[i] = 1;
|
|
|
|
|
}
|
|
|
|
|
if(tail>n) {
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
head++;
|
|
|
|
|
}
|
|
|
|
|
for(i=1;i<tail;i++)
|
|
|
|
|
printf("%d",que[i]);
|
|
|
|
|
getchar();
|
|
|
|
|
getchar();
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|