Compilare: main.cpp: In member function 'int Graph::dijkstra(int, int, int, int)': main.cpp:188: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] 188 | for(int i = 0 ; i < this->adjacency[current].size() ; i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, long long int> > Graph::dijkstraPathAndCost(int)': main.cpp:227: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] 227 | for(int i = 0 ; i < this->adjacency[current].size() ; i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::zeroOneBFS(int)': main.cpp:255: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] 255 | for(int i = 0 ; i < this->adjacency[current].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Solution::rusuoaica()': main.cpp:423:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 423 | for(int i = 0 ; i < newEdgeList.size() ; i++){ | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Solution::findCheapestPrice(int, std::vector<std::vector<int> >&, int, int, int)': main.cpp:452:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 452 | for(int i = 0; i < flights.size() ; i++) | ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'int Solution::dragoni1(std::ifstream&, int, int*)': main.cpp:471:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 471 | for(int i = 1 ; i < costs.size() ; i++){ | ~~^~~~~~~~~~~~~~ main.cpp: In member function 'int Solution::dragoni2(std::ifstream&, int, int*)': main.cpp:514:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 514 | for(int i = 0 ; i < graf[currentNode].size() ; i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Solution::jzzhuAndCities()': main.cpp:734:1: warning: no return statement in function returning non-void [-Wreturn-type] 734 | } | ^ main.cpp: In member function 'int Solution::dragoni2(std::ifstream&, int, int*)': main.cpp:531:1: warning: control reaches end of non-void function [-Wreturn-type] 531 | } | ^ main.cpp: In member function 'int Solution::apm2MaximumCost(Graph&, int, int, int)': main.cpp:611:21: warning: 'weight' may be used uninitialized [-Wmaybe-uninitialized] 611 | return weight - 1; | ^ main.cpp:591:9: note: 'weight' was declared here 591 | int weight; | ^~~~~~ main.cpp: In member function 'void Solution::trilant()': main.cpp:710:18: warning: 'index' may be used uninitialized [-Wmaybe-uninitialized] 710 | trilantOutput(g,pathCostC,index); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ main.cpp:697:9: note: 'index' was declared here 697 | int index,minimum = INT_MAX; | ^~~~~