Compilare: main.cpp: In member function 'void Graph::dfs(int, bool*)': main.cpp:212:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 212 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::outputAdj()': main.cpp:220:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 220 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bfsUtil(int, bool*)': main.cpp:304:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 304 | for (int i = 0; i < adj[node].size(); i++) //parcurg toti vecinii sai | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::topSort(int*, std::queue<int>)': main.cpp:410:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 410 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)': main.cpp:443:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 443 | if (top > degree_seq.size()) // daca valoarea primului element este mare decat numarul de elemente ramase, nu putem construi un astfel de graf | ~~~~^~~~~~~~~~~~~~~~~~~ main.cpp:446:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 446 | for (int i = 0 ; i < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra(int)': main.cpp:581: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] 581 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente ale lui node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bellmanFord(int, std::vector<int>&)': main.cpp:621: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] 621 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente cu node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bfsMaxFlow(int, int, std::vector<std::vector<int> >, int*, bool*)': main.cpp:664: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] 664 | for (int i = 0 ; i < adj_capacity[node].size(); i++) //parcurg toate nodurile adiacente cu nodul curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::EdmondsKarp(int, int)': main.cpp:693: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] 693 | for (int j = 0; j < adj_capacity[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfsUtil(int, int&, int, int&, bool*)': main.cpp:772:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 772 | for (int i = 0; i < adj[src].size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bfsHopcroftKarp(int*, int*, int*)': main.cpp:890:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 890 | for (int i = 0 ; i < adj[u].size() ; i++) //get all adjacent vertices of current node | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::dfsHopcroftKarp(int, int*, int*, int*)': main.cpp:910:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 910 | for (int i = 0 ; i < adj[u].size() ; i++) //get all adjacent vertices of current node