Compilare: main.cpp: In member function 'void Graf::bfs_si_distante(int, std::vector<std::vector<int> >&, std::vector<bool>&, std::vector<int>&)': main.cpp:142:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 142 | for (int j = 0; j < vecini[varf].size(); j++) //marchez toate varfurile adiacente cu el si nevizitate anterior, iar apoi le introduc in coada | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfs(int, std::vector<std::vector<int> >&, std::vector<bool>&)': main.cpp:196:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 196 | for (int j = 0; j < vecini[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfs_si_timp_de_finalizare(int, std::vector<std::vector<int> >&, std::vector<bool>&, std::stack<int>&)': main.cpp:242:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 242 | for (int j = 0; j < vecini[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfs_graf_transpus(int, std::vector<std::vector<int> >&, std::vector<bool>&, std::vector<std::vector<int> >&, int)': main.cpp:289:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 289 | for (int j = 0; j < vecini_transpus[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::solve_componente_tare_conexe(std::ifstream&, std::ofstream&)': main.cpp:350:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 350 | for (int j = 0; j < componente_tare_conexe[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfs_componente_biconexe(int, int, std::vector<std::vector<int> >&, std::vector<bool>&, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<std::vector<int> >&, int&)': main.cpp:367:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 367 | for (int j = 0; j < vecini[varf_fiu].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfs_diametrul_unui_arbore(int, int, int&, int&, std::vector<std::vector<int> >&, std::vector<bool>&)': main.cpp:675:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 675 | for (int j = 0; j < vecini[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent | ~~^~~~~~~~~~~~~~~~~~~~~