Compilare: main.cpp: In member function 'void Graph::dfs(int, bool*)': 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 < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::outputAdj()': main.cpp:221:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 221 | for (int i = 0 ; i < adj[node].size() ; i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bfsUtil(int, bool*)': main.cpp:316:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 316 | for (int i = 0 ; i < adj[node].size() ; i++) //go through all the adjacent nodes with node | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfsBiconnectedComponents(int, int, int*, int*, std::vector<std::vector<int> >&, std::stack<std::pair<int, int> >&, int&, bool*)': main.cpp:345:24: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare] 345 | for ( int i = 0 ; i< dim ; i++) | ~^~~~~ main.cpp: In member function 'std::vector<int> Graph::topSort(int*, std::queue<int>)': main.cpp:423:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 423 | for (int i = 0 ; i < adj[node].size() ; i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)': main.cpp:457:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 457 | if (top > degree_seq.size()) //if the value of the first element is greater than the number of elements remaining, we cannot construct such a graph | ~~~~^~~~~~~~~~~~~~~~~~~ main.cpp:460:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 460 | for (int i = 0 ; i < degree_seq.size() ; i++) //after removing the first element, subtract the degree of the remaining "nodes" | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra(int)': main.cpp:590:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 590 | for (int i = 0 ; i < adj_weight[node].size() ; i++) //for all adjacent nodes of node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bellmanFord(int, std::vector<int>&)': main.cpp:630:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 630 | for (int i = 0 ; i < adj_weight[node].size() ; i++) //for all adjacent nodes of node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bfsMaxFlow(int, int, std::vector<std::vector<int> >, int*, bool*)': main.cpp:673:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 673 | for (int i = 0 ; i < adj_capacity[node].size() ; i++) //traverse all nodes adjacent to the current node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::EdmondsKarp(int, int)': main.cpp:704:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 704 | for (int j = 0 ; j < adj_capacity[i].size() ; j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfsUtilDiameter(int, int&, int, int&, bool*)': main.cpp:778:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 778 | for (int i = 0 ; i < adj[src].size() ; i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bfsHopcroftKarp(int*, int*, int*)': main.cpp:892:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 892 | for (int i = 0 ; i < adj[u].size() ; i++) //get all adjacent vertices of current node