Compilare: main.cpp: In constructor 'Graf::Graf(int, std::unordered_map<int, std::vector<int> >&)': main.cpp:23:9: warning: 'Graf::nr_noduri' will be initialized after [-Wreorder] 23 | int nr_noduri; | ^~~~~~~~~ main.cpp:15:37: warning: 'std::unordered_map<int, std::vector<int> > Graf::lista_adiac' [-Wreorder] 15 | unordered_map<int, vector<int>> lista_adiac; | ^~~~~~~~~~~ main.cpp:31:5: warning: when initialized here [-Wreorder] 31 | Graf(int nr_noduri, unordered_map<int,vector<int>>&lista_adiac) : nr_noduri(nr_noduri), lista_adiac(lista_adiac){}; | ^~~~ main.cpp: In constructor 'Graf::Graf(int, std::unordered_map<int, std::vector<std::pair<int, int> > >&)': main.cpp:23:9: warning: 'Graf::nr_noduri' will be initialized after [-Wreorder] 23 | int nr_noduri; | ^~~~~~~~~ main.cpp:16:47: warning: 'std::unordered_map<int, std::vector<std::pair<int, int> > > Graf::lista_adiac_cost' [-Wreorder] 16 | unordered_map<int, vector<pair<int,int>>> lista_adiac_cost; | ^~~~~~~~~~~~~~~~ main.cpp:42:5: warning: when initialized here [-Wreorder] 42 | Graf(int nr_noduri, unordered_map<int,vector<pair<int,int>>>&lista_adiac) : nr_noduri(nr_noduri), lista_adiac_cost(lista_adiac){}; | ^~~~ main.cpp: In member function 'std::vector<int> Graf::topologicalSort(std::vector<std::vector<int> >&)': main.cpp:89:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 89 | for(int nod=0; nod<grade.size(); nod++) // pun pe stiva toate nodurile ce au gradul de intrare 0 | ~~~^~~~~~~~~~~~~ main.cpp:104:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 104 | if(ordine.size()!=nr_noduri){ // daca dimensiune lui ordine, unde se afla rezultatul, difera de nr de noduri | ~~~~~~~~~~~~~^~~~~~~~~~~