AtCoder Beginner Contest 168----D - .. (Double Dots)（bfs路径输出）

你是我可爱的诱惑，温柔的牵绊，无法割舍的存在.你说青涩最搭初恋，我们有相遇的时间，在风暖月光的地点，海之角也不再遥远.你我之间，看不见的宣言，一直都在，重复过很多年.

 

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <complex>
#include <iomanip>
#include <numeric>
#include<unordered_set>
#include <climits>//INT_100010n
#include <regex>
#include<deque>
//#include<bits/stdc++.h>
#define PP pair<ll,int>
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define llinf 0x3f3f3f3f3f3f3f3fll
#define dinf 1000000000000.0
#define PI 3.1415926535898
#define wc 1e-18
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
int deep[200010],fa[200010];
int t,n,m,u,v,fg=1;
vector<int>G[200010];
void bfs(int root)
{
    queue<int>Q;
    Q.push(root);
    fa[root] = 1;
    while(Q.size())
    {
        int top = Q.front();
        Q.pop();
        for(int i = 0; i < G[top].size(); i ++)
        {
            int y = G[top][i];
            if(fa[y])
                continue;
            Q.push(y);
            fa[y] = top;
        }
    }
    return ;
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= m; i ++)
    {
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    bfs(1);
    for(int i = 2; i <= n; i ++)
    {
        if(fa[i] == 0)
        {
            fg = 0;
            break;
        }
    }
    if(fg==0)
        printf("No\n");
    else
    {
        printf("Yes\n");
        for(int i = 2; i <= n; i ++)
            printf("%d\n",fa[i]);
    }
    return 0;
}