回顾19年省赛welcome party

vector<int> G[N];
int vis[N],ans[N];
int f[N];//求连通块个数，取连通块中的最小值，然后优先队列bfs
int dad(int x) { return f[x] == x ? x : f[x]=dad(f[x]); }
void merge(int x,int y)
{
	int fx = dad(x), fy = dad(y);
	if (fx > fy)f[fx] = fy;//根为联通块最小值
	else f[fy] = fx;
}
void bfs()
{
	set<int> st;
	int tot = 0;
	for (auto I : G[0]) { st.insert(I); vis[I] = 1; }
	while (!st.empty())
	{
		int it = *st.begin();st.erase(st.begin());
		ans[++tot] = it;
		for(auto I:G[it])
			if (!vis[I]) { vis[I] = 1;st.insert(I); }
	}
}
int main()
{
	int n, m,x,y;
	cin >> t;
	while (t--)
	{
		scanf("%d%d", &n, &m);
		f(i, 0, n)G[i].clear();
		f(i, 0, n)vis[i] = 0;
		f(i, 0, n)f[i] = i;
		while (m--)
		{
			scanf("%d%d", &x, &y);
			G[x].emplace_back(y);
			G[y].emplace_back(x);
			merge(x, y);
		}
		int res = 0;
		f(i, 1, n)
			if (f[i] == i)
			{
				res++;G[0].emplace_back(i);
			}
	
		cout << res << endl;
		bfs();
		f(i, 1, n) {
			if(i!=n)
			printf("%d ", ans[i]);
			else printf("%d\n", ans[i]);
		}
	}
	return 0;
}