Compilare: main.cpp: In member function 'void Graph::DFS(int, std::vector<int>&, int)': main.cpp:84:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 84 | for(int i = 0; i<Ad[node].size(); ++i) | ~^~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::BFS(int, std::vector<int>&)': main.cpp:109:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 109 | for(int i = 0; i<Ad[parent].size(); ++i) | ~^~~~~~~~~~~~~~~~~~ main.cpp:102:17: warning: unused variable 'distance' [-Wunused-variable] 102 | int parent, distance; | ^~~~~~~~ main.cpp: In member function 'void Graph::topSortDFS(int, std::vector<int>&, std::stack<int>&)': main.cpp:126:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 126 | for(int i = 0; i<Ad[node].size(); ++i) | ~^~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::tuple<int, int, int> > Graph::getMST()': main.cpp:183:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edgeCost>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 183 | for(int j = 0; j<AdCost[i].size(); ++i) | ~^~~~~~~~~~~~~~~~~ main.cpp:187:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 187 | for(int i = 0; i<edges.size() && solSize < n-1; ++i){ | ~^~~~~~~~~~~~~ main.cpp:176:22: warning: unused variable 'cost' [-Wunused-variable] 176 | int solSize = 0, cost = 0; | ^~~~ main.cpp:177:11: warning: unused variable 'm' [-Wunused-variable] 177 | int n,m,x,y,c; | ^ main.cpp:177:17: warning: unused variable 'c' [-Wunused-variable] 177 | int n,m,x,y,c; | ^ main.cpp: In member function 'void Graph::dfsSCC(int, int&, std::vector<int>&, std::vector<int>&, std::vector<bool>&, std::stack<int>&, std::vector<std::vector<int> >&)': main.cpp:203:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 203 | for(int i = 0; i<Ad[node].size(); ++i){ | ~^~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfsBCC(int, int, int&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:243:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 243 | for(int i = 0; i<Ad[node].size(); ++i){ | ~^~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::bellman(bool&, std::vector<int>&, int)': main.cpp:299:25: 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<Ad[currentNode].size(); ++i){ | ~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dijkstra(std::vector<int>&, int)': main.cpp:348:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 348 | for(int i = 0; i < Ad[currentNode].size(); ++i){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::getDijkstraDistance(int)': main.cpp:370:1: warning: no return statement in function returning non-void [-Wreturn-type] 370 | }