Cod sursa(job #1374655)
Utilizator | Soare Roxana Florentina roxana_97 | Data | 5 martie 2015 10:25:10 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
#include<vector>
#define Nmax 100009
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int x,y,n,m,sol,comp[Nmax];
vector<int> G[Nmax];
void DFS(int node)
{
comp[node]=sol;
for(vector<int> :: iterator it=G[node].begin();it!=G[node].end();it++)
if(!comp[*it]) DFS(*it);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!comp[i])
{
++sol;
DFS(i);
}
g<<sol<<'\n';
f.close();g.close();
return 0;
}