Cod sursa(job #2133950)
| Utilizator | Data | 17 februarie 2018 14:42:11 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in ("dfs.in");
ofstream out ("dfs.out");
vector<int> lista[100001];
bool viz[100001];
void dfs(int u)
{
viz[u]=1;
int i;
for(i=0;i<lista[u].size();i++)
if(viz[lista[u][i]]==0)
dfs(lista[u][i]);
}
int main()
{
int n,m,i,x,y,c=0;
in>>n>>m;
for(i=1;i<=m;i++)
{
in>>x>>y;
lista[x].push_back(y);
lista[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
c++;
}
}
out<<c;
return 0;
}
