Compilare: main.cpp: In member function 'std::vector<int> Graph::bfs(int)': main.cpp:110:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 110 | for (int i = 0; i < neighbors[aux.front()].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)': main.cpp:147:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 147 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::biconnected_dfs(int, int&, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<std::vector<int> >&, std::vector<int>&)': main.cpp:194:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 194 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::stronglyconnected_dfs(int, int&, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<std::vector<int> >&, std::vector<bool>&)': main.cpp:257:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 257 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::topological_dfs(int, std::vector<bool>&, std::stack<int>&)': main.cpp:312:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 312 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)': main.cpp:328:24: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 328 | if (degrees[0] > degrees.size() - 1) //gradul unui nod este mai mare decat nr de noduri disponibile main.cpp: In member function 'void Graph::cconnections_dfs(int, int&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:371:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 371 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::apm(int&)': main.cpp:438:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 438 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra()': main.cpp:477:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 477 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:488:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 488 | for(int i =0; i < distances.size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:523:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 523 | for (int i = 1; i < aux.size(); i++) | ~~^~~~~~~~~~~~