Compilare: main.cpp: In member function 'void Graf::BFS()': main.cpp:80:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 80 | for (int j = 0; j < adiacenta[nodPlecare].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::DFS(int)': main.cpp:112:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 112 | for (int i = 0; i < adiacenta[nodPlecare].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::DF1(int)': main.cpp:119:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 119 | for (int i = 0; i < adiacenta[nodPlecare].size(); i++)///parcurg toti vecinii nodului | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::DF2(int)': main.cpp:127:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 127 | for (int i = 0; i < adiacenta2[nodPlecare].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::citireBFS(int&)': main.cpp:61:20: warning: iteration 100000 invokes undefined behavior [-Waggressive-loop-optimizations] 61 | vizitat[i] = -1; | ~~~~~~~~~~~^~~~ main.cpp:60:23: note: within this loop 60 | for (int i = 1; i <= maxi; i++) | ^