#19
BFS
Se consideră un graf neorientat cu n
vârfuri și m
muchii și un vârf cunoscut X
. Să se afişeze vârfurile vizitate în urma parcurgerii în lățime a grafului pornind din vârful X
.
Problema | BFS | Operații I/O |
BFS.in /BFS.out
|
---|---|---|---|
Limita timp | 1 secunde | Limita memorie |
Total: 128 MB
/
Stivă 8 MB
|
Id soluție | #29658446 | Utilizator | |
Fișier | bfs.cpp | Dimensiune | 560 B |
Data încărcării | 14 Mai 2021, 09:36 | Scor / rezultat | Eroare de compilare |
bfs.cpp:1:2: error: invalid preprocessing directive #inlcude #inlcude<fstream> ^ bfs.cpp:3:1: error: 'ifstream' does not name a type ifstream fin("BFS.in"); ^ bfs.cpp:4:1: error: 'ofstream' does not name a type ofstream fout("BFS.out"); ^ bfs.cpp:5:17: error: expected initializer before numeric constant int i,n,m,a[101]101],viz[101],c[101],p,u,np; ^ bfs.cpp: In function 'void bfs()': bfs.cpp:8:5: error: 'p' was not declared in this scope p=u=1; ^ bfs.cpp:8:7: error: 'u' was not declared in this scope p=u=1; ^ bfs.cpp:9:5: error: 'c' was not declared in this scope c[p]=np; ^ bfs.cpp:9:10: error: 'np' was not declared in this scope c[p]=np; ^ bfs.cpp:10:5: error: 'viz' was not declared in this scope viz[np]=1; ^ bfs.cpp:13:9: error: 'x' was not declared in this scope x=c[p]; ^ bfs.cpp:15:16: error: 'a' was not declared in this scope if(a[x][i] && viz[i]==0) ^ bfs.cpp: In function 'int main()': bfs.cpp:26:5: error: 'fin' was not declared in this scope fin>>n>>m>>p; ^ bfs.cpp:26:16: error: 'p' was not declared in this scope fin>>n>>m>>p; ^ bfs.cpp:27:16: error: 'x' was not declared in this scope while(fin>>x>>y) ^ bfs.cpp:27:19: error: 'y' was not declared in this scope while(fin>>x>>y) ^ bfs.cpp:28:9: error: 'a' was not declared in this scope a[x][y]=a[y][x]=1; ^ bfs.cpp:30:9: error: expected ';' before 'for' for(i=1;i<=n;i++) ^ bfs.cpp:30:18: warning: statement has no effect [-Wunused-value] for(i=1;i<=n;i++) ^ bfs.cpp:30:25: error: expected ';' before ')' token for(i=1;i<=n;i++) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema BFS face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.