novato.cpp

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 10;

vector<int> G[maxn];
bool vis[maxn];


void connect(int a, int b)
{
	G[a].push_back(b);
	G[b].push_back(a);
}

void dfs(int x)
{
	vis[x] = true;

	cout << x << "\n";

	for(int u : G[x])
	{
		if(!vis[u]) dfs(u);
	}
}

void bfs(int x)
{
	queue<int> q;
	q.push(x);

	while(!q.empty())
	{
		int atual = q.front();
		q.pop();

		vis[atual] = true;

		cout << atual << "\n";

		for(int u : G[atual])
		{
			if(!vis[u]) q.push(u);
		}
	}
}


int main()
{

int n, m;

cin >> n >> m;

	for(int i = 0; i < m; i++)
	{
		int a, b;
		cin >> a >> b;

		connect(a, b);
	}

	bfs(1);
}