Cod sursa(job #1857468)
| Utilizator | Data | 26 ianuarie 2017 11:36:55 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
#include<vector>
#define maxn 100010
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
long viz[maxn];
long i,n,m,nr,x,y;
vector<long> a[maxn];
void dfs(long x){
viz[x]=1;
for(long j=0;j<a[x].size();j++)
if(!viz[a[x][j]])
{
dfs(a[x][j]);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(!viz[i])
{
dfs(i);
nr++;
}
}
g<<nr;
return 0;
}
