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:145:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 145 | 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:194:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 194 | 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:236:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 236 | 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:280:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 280 | 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:333:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 333 | 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:350:20: 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 < vecini[varf_fiu].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::solve_componente_biconexe(std::ifstream&, std::ofstream&)': main.cpp:417:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 417 | for (int j = 0; j < de_afisat[i].size(); j ++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::dfs_muchii_critice(int, int, std::vector<std::vector<int> >&, std::vector<bool>&, std::vector<int>&, std::vector<int>&, std::vector<std::pair<int, int> >&)': main.cpp:430:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 430 | for (int j = 0; j < vecini[varf_fiu].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::solve_muchii_critice(std::ifstream&, std::ofstream&)': main.cpp:481:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 481 | for (int i = 0; i < de_afisat.size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::solve_Dijkstra(std::ifstream&, std::ofstream&)': main.cpp:649:23: warning: left operand of comma operator has no effect [-Wunused-value] 649 | vector<int>d((noduri + 1, 1000000)); // vector in care este stocat costul minim al unui drum de la u la v, descoperit pana la acel moment | ~~~~~~~^~~ 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:787:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 787 | 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::solve_ciclu_eulerian(std::ifstream&, std::ofstream&)': main.cpp:864:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 864 | for (int i = 0; i < componente_ciclu_eulerian.size() - 1; i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~