Cod sursa(job #2372979)
| Utilizator | Data | 7 martie 2019 11:40:47 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector <int> g[10000];
queue <int> q;
int viz[10000];
int main()
{
int n, m, s, x, y, i;
ifstream in("bfs.in");
ofstream out("bfs.out");
in >> n >> m >> s;
for(i = 0; i < m; i++)
{
in >> x >> y;
g[x].push_back(y);
}
return 0;
}
