Cod sursa(job #2217744)
| Utilizator | Data | 1 iulie 2018 23:46:38 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 100002
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n, m;
int conex[NMAX];
int maxim = 0;
void Read(void)
{
fin >> n >> m;
int a, b;
for (int i = 0; i < m; i++)
{
conex[i + 1]++;
fin >> a >> b;
conex[a]++; conex[b]++;
if (maxim < conex[a])
{
maxim = conex[a];
}
if (maxim < conex[b])
{
maxim = conex[b];
}
}
}
int main(void)
{
Read();
fout << maxim;
return 0;
}