Pagini recente » Cod sursa (job #4856) | Cod sursa (job #2054891) | Cod sursa (job #910140) | Profil HornyWhale | Cod sursa (job #1442891)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
void bfs(vector< vector<int> > &v, vector< vector<int> >& viz, int nod, ofstream& g)
{
for (int j = 0; j < v[nod].size(); j++)
{
if (!viz[nod][j])
{
g << nod << " ";
viz[nod][j] = 1;
bfs(v, viz, v[nod][j], g);
}
}
}
int main()
{
unsigned int n, m, i, j, nod1, nod2;
ifstream f("ciclueuler.in");
f >> n >> m;
vector< vector<int> > v(n + 1);
vector< vector<int> > viz(n+1,vector<int>(n+1, 0));
for (i = 0; i < m; i++)
{
f >> nod1 >> nod2;
v[nod1].push_back(nod2);
}
ofstream g("ciclueuler.out");
for (i = 1; i <= n; i++)
{
for (j = 0; j < v[i].size(); j++)
{
if (!viz[i][j])
{
g << i << " ";
viz[i][j] = 1;
bfs(v, viz, v[i][j], g);
}
}
}
f.close();
g.close();
return 0;
}