Cod sursa(job #1323848)

Utilizator VehuiahVehuiah Vehuiah Vehuiah Data 21 ianuarie 2015 16:44:27
Problema Parcurgere DFS - componente conexe Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>
#include <vector>
#define maxnumber 1000

using namespace std;

fstream f("dfs.in");
ofstream g("dfs.out");

int n,m,sol;

bool vizitat[10];

vector<int> graf[maxnumber];

int citire()
{
    f>>n>>m;
    for(int i=1;i<=3;i++)
    {
        int a,b;
        f>>a>>b;
        graf[a].push_back(b);
        graf[b].push_back(a);
    }
    return true;
}

int dfs(int nod)
{
    vizitat[nod] = true;

    for(int i=0, length= graf[nod].size(); i<length;i++)
    {
        if(vizitat[graf[nod][i]] == false)
            {
                dfs(graf[nod][i]);
            }
    }

}

int main()
{
    citire();
    for(int i=0; i<n; i++)
    {
        if(!vizitat[i]) sol++;
        dfs(i);
    }
    g<<sol;
}