Cod sursa(job #1438183)
| Utilizator | Data | 19 mai 2015 11:12:03 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector <int> G[100001];
int marcat[100001];
void dfs(int x)
{
marcat[x]=1;
for(vector<int>::iterator it=G[x].begin();it!=G[x].end();it++)
if(marcat[*it]==0) dfs(*it);
}
int main()
{
int n,m,i,a,b;
in>>n>>m;
for(i=1;i<=m;i++)
{
in>>a>>b;
G[a].push_back(b);
G[b].push_back(a);
}
int cnt=0;
for(i=1;i<=n;i++)
if(!marcat[i])
{
dfs(i);
cnt++;
}
out<<cnt;
}
