Compilare: main.cpp: In member function 'bool Graph::hakimi(std::vector<int>)': main.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 67 | for(int i = 0; i < v.size(); i++){ | ~~^~~~~~~~~~ main.cpp:69:17: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 69 | if(v[i] >= v.size()) return false; main.cpp: In member function 'virtual void Undirected_graph::DFS(int, std::vector<int>&)': main.cpp:158:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 158 | for(int i = 0; i < this->m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Undirected_graph::DFSBiconnected(int, int, int, std::vector<int>&, std::vector<int>&, std::vector<std::unordered_set<int> >&, std::stack<std::pair<int, int> >&)': main.cpp:261:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 261 | for(int i = 0; i < this->m_adjancency_list[current_node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Undirected_graph::DFSCriticals(int, int&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:334:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 334 | for(int i = 0; i < m_adjancency_list[current_node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Unoriented_bipartite_graph::DFS(int, std::vector<int>&, std::vector<int>&, std::vector<int>&)': main.cpp:487:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 487 | for(int i = 0; i < m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:508:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 508 | for(int i = 0; i < m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'virtual std::vector<int> Directed_graph::BFS(int)': main.cpp:641:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 641 | for(int i=0; i < this->m_adjancency_list[curent].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Directed_graph::tarjan(int, std::stack<int>&, std::vector<int>&, std::vector<int>&, int&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:736:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 736 | for(int i=0; i<this->m_adjancency_list[node].size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Directed_graph::DFS_topological_sort(int, std::stack<int>&, std::vector<int>&)': main.cpp:818:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 818 | for(int i = 0; i < this->m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, int> > Unoriented_graph_with_costs::prim(int&)': main.cpp:939:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 939 | for(int j = 0; j < this->m_adjancency_list[root].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Unoriented_graph_with_costs::introduce_in_APM(int, std::vector<int>&, std::vector<int>&)': main.cpp:957: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] 957 | for(int i = 0; i < this->m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Unoriented_graph_with_costs::push(int, std::vector<int>&, std::vector<int>&, std::vector<int>&)': main.cpp:1038:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 1038 | while((index * 2 <= heap.size() - 1 && distances[ heap[index] ] > distances[ heap[index * 2] ]) || | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~ main.cpp:1039:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]