Compilare: main.cpp: In member function 'void Graph::printGraph()': main.cpp:165:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 165 | for(int j = 0; j < adlist[i].size(); ++j) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'Graph Graph::transpose()': main.cpp:244:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 244 | for(j = 0; j < adlist[i].size(); ++j) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::stronglyConnectedComponents()': main.cpp:276:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 276 | for(j = 0; j < comp[i].size(); ++j) | ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::graphExistsHakimi(std::vector<int>&, int)': main.cpp:315:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 315 | if(degree > dg.size())//check if enough elements are in the list | ~~~~~~~^~~~~~~~~~~ main.cpp:318:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 318 | for(int i = 0; i < dg.size(); ++i) //substract 1 from the following | ~~^~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > Graph::criticalConnections(int, std::vector<std::vector<int> >&)': main.cpp:372:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 372 | for(int i = 0; i < connections.size(); ++i)//for each edge | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::biconnectedComponents()': main.cpp:402:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 402 | for(int i = 0; i < biconnected.size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp:405:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 405 | for(int j = 0 ; j < comp.size(); ++j) | ~~^~~~~~~~~~~~~ main.cpp: In member function 'void Graph::kruskal()': main.cpp:490:41: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 490 | for(int i = 1; i <= m && sol.size() != n-1; ++i)//for each edge until we choose n-1 | ~~~~~~~~~~~^~~~~~ main.cpp:505:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 505 | for(int i = 0; i < sol.size(); ++i) | ~~^~~~~~~~~~~~ main.cpp: In member function 'void Graph::dijkstra()': main.cpp:560:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 560 | for(int i = 0; i < adj_cost[node].size(); ++i)//for all nodes that "node" is connected to | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::bellmanford()': main.cpp:623:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 623 | for(int i = 0; i < adj_cost[node].size(); ++i) //for each neighbour | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::Euler()': main.cpp:849:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 849 | for(int i = 0; i < euler_cicle.size() - 1; ++i) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()':