Compilare: main.cpp: In member function 'void Graph::DFS(int, std::vector<int>&)': main.cpp:60:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 60 | for(int i = 0; i < edges[start].size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In destructor 'Graph::~Graph()': main.cpp:74:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, double> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 74 | for(int i = 1; i <= edges.size(); ++i) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::printEdges()': main.cpp:80:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, double> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 80 | for(int i = 1; i < edges.size(); i++) | ~~^~~~~~~~~~~~~~ main.cpp: In member function 'std::stack<int> DirectedGraph::TopologicalSorting()': main.cpp:216:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 216 | for(int node = 1; node < visited.size(); ++node) | ~~~~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > UndirectedGraph::criticalEdges()': main.cpp:351:9: warning: unused variable 'counterID' [-Wunused-variable] 351 | int counterID = 0; | ^~~~~~~~~ main.cpp: In member function 'bool UndirectedGraph::havelHakimi(std::vector<int>)': main.cpp:402:23: 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] 402 | if(degrees[0] > degrees.size() - loops) main.cpp: In function 'int main()': main.cpp:442:20: warning: unused variable 's' [-Wunused-variable] 442 | int n, m, x, y,s; | ^