Cod sursa(job #3318463)
| Utilizator | Data | 28 octombrie 2025 12:45:50 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int>L[100001];
int N,M,cc,vis[100001];
void DFS(int nod)
{
vis[nod]=1;
for(int v=0;v<L[nod].size();v++)
if(vis[L[nod][v]]==0)
DFS(L[nod][v]);
}
int main()
{
int x,y;
f>>N>>M;
for(int i=1;i<=M;i++)
{
f>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
}
cc=0;
for(int i=1;i<=N;i++)
if(vis[i]==0)
{
DFS(i);
cc++;
}
g<<cc;
return 0;
}
