Eroare de compilare: main.cpp: In member function 'void Graph::dfs(int, bool*)': main.cpp:207:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 207 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::outputAdj()': main.cpp:215:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 215 | for (int i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bfsUtil(int, bool*)': main.cpp:299:27: 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 < adj[node].size(); i++) //parcurg toti vecinii sai | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::topSort(int*, std::queue<int>)': 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 i = 0; i < adj[node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)': main.cpp:438:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 438 | 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:441:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 441 | for (int i = 0 ; i < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, int> > Graph::apmUtil(std::vector<std::tuple<int, int, int> >&)': main.cpp:508:45: error: no matching function for call to 'std::vector<std::pair<int, int> >::push_back(std::tuple<int, int>)' 508 | apm.push_back(make_tuple(n1, n2)); | ^ In file included from /usr/include/c++/10/vector:67, from main.cpp:10: /usr/include/c++/10/bits/stl_vector.h:1187:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, int>]' 1187 | push_back(const value_type& __x) | ^~~~~~~~~ /usr/include/c++/10/bits/stl_vector.h:1187:35: note: no known conversion for argument 1 from 'std::tuple<int, int>' to 'const value_type&' {aka 'const std::pair<int, int>&'} 1187 | push_back(const value_type& __x) | ~~~~~~~~~~~~~~~~~~^~~ /usr/include/c++/10/bits/stl_vector.h:1203:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, int>]' 1203 | push_back(value_type&& __x) | ^~~~~~~~~ /usr/include/c++/10/bits/stl_vector.h:1203:30: note: no known conversion for argument 1 from 'std::tuple<int, int>' to 'std::vector<std::pair<int, int> >::value_type&&' {aka 'std::pair<int, int>&&'} 1203 | push_back(value_type&& __x) | ~~~~~~~~~~~~~^~~ main.cpp: In member function 'void Graph::Dijkstra()': main.cpp:577: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] 577 | 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:616: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] 616 | 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*)': Non zero exit status: 1