Cod sursa(job #1891768)
Utilizator | Data | 24 februarie 2017 12:11:21 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
#include<vector>
using namespace std;
int x,y,f;
vector < vector < int > > v(100000);
ifstream in("dfs.in");
ofstream out("dfs.out");
bool c[100001];
void dfs(int k)
{
c[k]=1;
f++;
int f=v[k].size();
for(int i=0;i<f;i++)
if(c[v[k][i]]==0)
dfs(v[k][i]);
}
int main()
{
int n,m;
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
int z=0;
for(int i=1;i<=n;i++)
if(c[i]==0)
{
z++;
dfs(i);
}
out<<z;
}