Cod sursa(job #1762875)
| Utilizator | Data | 24 septembrie 2016 10:59:37 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> lv[100000];
vector <int>::iterator ii;
int main()
{
int n, m, x, y;
f >> n >> m;
g << n - m;
/*for (int i = 0; i < m; i++)
{
f >> x >> y;
lv[x].push_back(y);
lv[y].push_back(x);
}
for (int i = 1; i <= n; i++)
{
cout << "Lista vecini " << i << ":";
for (ii = lv[i].begin(); ii != lv[i].end(); ++ii)
cout << *ii << " ";
cout << "\n";
}
cout << "\n";*/
return 0;
}