Pagini recente » Cod sursa (job #1951267) | Cod sursa (job #3196730) | Cod sursa (job #1949354) | Cod sursa (job #97406) | Cod sursa (job #2373529)
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f1("sortaret.in");
ofstream f2("sortaret.out");
int n,m;
vector<int> legaturi[50005];
bitset<50005> viz;
vector<int> solutie;
void dfs(int start){
solutie.push_back(start);
viz[start] = true;
for(auto nod : legaturi[start]){
if(viz[nod] == false)
dfs(nod);
}
}
int main() {
f1>>n>>m;
int x,y;
for(int i=0;i<m;i++){
f1>>x>>y;
legaturi[x].push_back(y);
}
dfs(1);
for(auto nod : solutie){
f2<<nod<<" ";
}
return 0;
}