Cod sursa(job #1442881)

Utilizator TheHolyArkCristian Petrescu TheHolyArk Data 26 mai 2015 15:23:10
Problema Ciclu Eulerian Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#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()
{
	int n, m, i, j, nod1, nod2, flag = 1;
	ifstream f("euler_in.txt");
	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);
	}
	for (i = 1; i <= n; i++)
	for (j = 0; j < v[i].size(); j++)
		cout << "v[" << i << "][" << j << "]= " << v[i][j]<<"\n";
	ofstream g("euler_out.txt");

	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();
	system("PAUSE");
	return 0;
}