Pagini recente » Cod sursa (job #743828) | Cod sursa (job #1156267) | Cod sursa (job #1019383) | Cod sursa (job #2407208) | Cod sursa (job #2419935)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int nrNoduri, nrMuchii;
vector <int> *lista;
bool *vizitat;
void dfs(int nodStart){
vizitat[nodStart] = true;
int nrVecini = lista[nodStart].size();
for ( int vecin = 0; vecin < nrVecini; vecin++)
if ( !vizitat[lista[nodStart][vecin]] )
dfs(lista[nodStart][vecin]);
fout << nodStart << " ";
}
int main(){
if ( !fin ){
cout << "\nEroare la deschiderea fisierului !\n";
// exit(-1);
}
fin >> nrNoduri >> nrMuchii;
// lista = nullptr;
// vizitat = nullptr;
lista = new vector<int>[nrNoduri + 5];
vizitat = new bool[nrNoduri + 5];
for ( int i = 1; i <= nrNoduri; i++)
vizitat[i] = false;
for ( int i = 1; i <= nrMuchii; i++){
int x, y;
fin >> x >> y;
lista[x].push_back(y);
}
dfs(1);
/*
for ( int i = 0; i < nrNoduri; i++){
cout << i + 1<<": ";
for ( int j = 0; j < lista[i].size(); j++)
cout << lista[i][j] + 1 << " ";
cout << "\n";
}
*/
return 0;
}