Compilare: main.cpp: In member function 'int Graph::hamilton()': main.cpp:166:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 166 | for (int k = 0; k < adj_list_costs[j].size(); k++) // Get through all the neighbours of the node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:178: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] 178 | for (int i = 0; i < adj_list_costs[0].size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfs_si_timp_de_finalizare(int, std::vector<std::vector<int> >&, std::vector<bool>&, std::stack<int>&)': main.cpp:285:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 285 | for (int j = 0; j < vecini[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfs_graf_transpus(int, std::vector<std::vector<int> >&, std::vector<bool>&, std::vector<std::vector<int> >&, int)': main.cpp:300:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 300 | 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 Graph::solve_componente_tare_conexe(std::ifstream&, std::ofstream&)': main.cpp:353:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 353 | for (int j = 0; j < componente_tare_conexe[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~