Compilare: main.cpp: In member function 'void Graph::dfs(int)': main.cpp:206:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 206 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::outputAdj(int)': 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 'std::vector<int> Graph::bfsUtil(int)': main.cpp:287:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 287 | for (int i = 0; i < adj[node].size(); i++) //parcurg toti vecinii sai | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::topSort(int*, std::queue<int>)': main.cpp:395:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 395 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)': main.cpp:427:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 427 | 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:430:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 430 | for (int i = 0 ; i < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::apmUtil(std::vector<std::tuple<int, int, int> >&)': main.cpp:509:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 509 | for (int i = 0; i < apm.size(); i++) | ~~^~~~~~~~~~~~ main.cpp: In member function 'void Graph::Dijkstra()': main.cpp:568:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 568 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente ale lui node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::BellmanFord()': main.cpp:606:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 606 | 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*)': main.cpp:646:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 646 | 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:673:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 673 | for (int j = 0; j < adj_capacity[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfsUtil(int, int&, int, int&)': main.cpp:752:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 752 | for (int i = 0; i < adj[src].size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::bfsHopcroftKarp(int*, int*, int*)': main.cpp:869:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 869 | for (int i = 0 ; i < adj[u].size() ; i++) //get all adjacent vertices of current node