Compilare: main.cpp: In member function 'std::vector<int> Graph::bfs(int)': main.cpp:164:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 164 | for (int i = 0; i < _adjacentList[node].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfs(int, std::vector<int>&)': main.cpp:179:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 179 | for (int i = 0; i < _adjacentList[node].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'bool havel_hakimi(std::istream&)': main.cpp:213:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 213 | for (int i = 0; i < grade.size(); i++) | ~~^~~~~~~~~~~~~~ main.cpp:214:22: 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] 214 | if (grade[i] > grade.size() - 1) { main.cpp: In member function 'std::vector<int> Graph::sortareTopologica()': main.cpp:251:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 251 | for (int j = 0; j < _adjacentList[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:268:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 268 | for (int i = 0; i < _adjacentList[varf].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::transpose()': main.cpp:283:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 283 | for (j = 0; j < _adjacentList[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfsCtc(int, std::vector<int>&, std::vector<int>&)': main.cpp:293:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 293 | for (int i = 0; i < _adjacentList[node].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::biconexe(int, int, std::stack<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:354:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 354 | for (int i = 0; i < _adjacentList[node].size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::Dijkstra(int)': main.cpp:422:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 422 | for (int i = 0; i < _adjacentListWithCosts[currentNode].size(); ++i) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, int> > Graph::apm(int)': main.cpp:457:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 457 | for (int i = 0; i < _adjacentListWithCosts[currentNode].size(); ++i) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::Bellmanford(int, std::ofstream&)': main.cpp:533:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 533 | for (int i = 0; i < _adjacentListWithCosts[currentNode].size(); ++i) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfsDarb(int, std::vector<int>&, int, std::vector<int>&)': main.cpp:626:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 626 | for (int i = 0; i < _adjacentList[node].size(); ++i) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::dfsCuplaj(int, std::vector<int>&, std::vector<int>&, std::vector<int>&)':