Cod sursa(job #1243731)
Utilizator | Tannous Marc tannous.marc | Data | 16 octombrie 2014 12:01:54 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
bitset<100000> viz;
vector<int> G[100001];
int n,m,cnt=0;
void dfs(int nod){
if(viz[nod]) return;
cnt++;
for(int i=0;i<G[nod].size();i++)
{
viz[G[nod][i]]=1;
dfs(G[nod][i]);
}
}
int main()
{
ifstream in("dfs.in");
ofstream out("dfs.out");
in>>n>>m;
int x,y;
for(int i=1;i<=m;i++)
{
in>>x>>y;
G[x].push_back(y);
}
for(int i=1;i<=n;i++)
dfs(i);
out<<cnt;
return 0;
}