Compilare: main.cpp: In member function 'void Graph::print_solution(std::vector<int>, int)': main.cpp:256:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 256 | for(int i = start; i < solution.size(); i ++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::BFS(int)': main.cpp:282:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 282 | for(i = 0; i < edges[curr].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFS(int)': main.cpp:299:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 299 | for(int i = 0; i < edges[curr].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::biconnected_utility(int, std::stack<int>&, std::vector<int>&, std::vector<std::vector<int> >&, int&)': main.cpp:312:22: 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 < edges[curr].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::biconnected()': main.cpp:402:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 402 | for (int j = 0; j < solution[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFS_kosaraju(int, std::vector<std::vector<int> >&, std::vector<int>&)': main.cpp:415:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 415 | for(int j = 0; j < reversed[curr].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::strongly_connected()': main.cpp:465:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 465 | for(i = 0; i < solution.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp:467:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 467 | for(int j = 0; j < solution[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::top_sort_utility(int, std::stack<int>&)': main.cpp:478:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 478 | for(int i = 0; i < edges[curr].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::critical(int, int, std::vector<std::vector<int> >&, std::vector<int>&)': main.cpp:552:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 552 | for(i = 0; i < edges[curr].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::bridges()': main.cpp:586:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 586 | for(int i = 0; i < sol.size(); i++) | ~~^~~~~~~~~~~~ main.cpp: In member function 'void Graph::bellman_ford()': main.cpp:608: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] 608 | for(j = 0; j < weightedNeighbours[u].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::edmonds_karp()': main.cpp:653:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 653 | for(i = 0; i < edges[curr].size(); i++)