Pagini recente » Cod sursa (job #1937185) | Cod sursa (job #2405285) | Atasamentele paginii Clasament preoji2014_3_11_12 | Cod sursa (job #2405726) | Cod sursa (job #2372887)
#include <iostream>
#include <vector>
#include<fstream>
using namespace std;
vector <int> graph[10000];
int viz[10000];
int nrc=0;
void dfs(int x)
{
viz[x]=0;
int i,lim=graph[x].size();
for(i=1; i<=lim; i++)
if(graph[x][i]==1 && viz[i]==0)
dfs(i);
}
int main()
{
ifstream f("graf.in");
ofstream g("graf.out");
int N,M,x,y;
f>>N>>M;
int i;
for(i=1; i<=M; i++)
{
f>>x>>y;
graph[x].push_back(y);
graph[y].push_back(x);
}
for (i=1; i<=M; i++)
{
if(viz[i]==0)
{
dfs(i);
nrc++;
}
}
g<<nrc<<endl;
g.close();
f.close();
return 0;
}