Pagini recente » Cod sursa (job #2344950) | Cod sursa (job #1757832) | Cod sursa (job #1618568) | Cod sursa (job #2351981) | Cod sursa (job #1238579)
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
#define NMax 100005
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,sol;
int viz[NMax];
vector<int> v[NMax];
stack<int> st;
void DFS(int s)
{
int i;
st.push(s);
viz[s]=1;
while(!st.empty())
{
s=st.top();
st.pop();
for(i=0;i<v[s].size();++i) if(!viz[v[s][i]])
{
viz[v[s][i]]=1;
st.push(v[s][i]);
}
}
}
int main()
{
int i,a,b;
f>>n>>m;
for(i=1;i<=m;++i)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(i=1;i<=n;++i) if(!viz[i]) {DFS(i);sol++;}
g<<sol<<"\n";
f.close();
g.close();
return 0;
}