Cod sursa(job #1441131)
Utilizator | Data | 23 mai 2015 18:56:52 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,a,b,x,c=0;
vector <int> G[100001];
int viz[100001];
void dfs(int x)
{
viz[x]=1;
for(int i=0;i!=G[x].size();i++)
{
if(viz[G[x][i]]==0)
dfs(G[x][i]);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
G[a].push_back(b);
G[b].push_back(a);
}
for(int i=1;i<=n;i++)
if(!viz[i])
{
dfs(i);
c++;
}
g<<c;
return 0;
}