Cod sursa(job #565694)
| Utilizator | Data | 28 martie 2011 10:17:40 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <bitset>
using namespace std;
#define dim 100005
int n;
struct nod
{
int info;
nod *next;
};
nod *lista[dim];
bitset <dim> vizitat;
void dfs(int nod)
{
if(!v[nod])
{
v[nod]=1;
for(int i=1;i<=n;++i)
if(mat[i][nod]&&!v[i])
dfs(i);
}
}
int main()
{
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int m,i ,a ,b;
fin>>n >>m;
for(i=1;i<=m;++i)
{
fin>>a >>b;
fout<<contor;
return 0;
}