Pagini recente » Cod sursa (job #3264154) | Cod sursa (job #3259182) | Rating Silaghi Razvan-Andrei (Wister1043) | Rating arhip georgiana (georgy_romania) | Cod sursa (job #1232127)
#include <fstream>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n,m,a,b,rez[50000],cnt=1;;
bool viz[50000],muchii[20000][20000];
void dfs(int poz)
{
int j;
viz[poz]=1;
rez[cnt]=poz;
cnt++;
for(j=1;j<=n;j++) if(viz[j]==0 && muchii[poz][j]==1)
{
dfs(j);
}
}
int main()
{
in>>n>>m;
int i;
for(i=1;i<=n;i++)
{
in>>a>>b;
muchii[a][b]=1;
muchii[b][a]=1;
}
for(i=1;i<=n;i++)
{
if(viz[i]==0) dfs(i);
}
for(i=1;i< cnt;i++) out<<rez[i]<<" ";
in.close();
out.close();
return 0;
}