Compilare: main.cpp: In member function 'void Graf::BFS()': main.cpp:114:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 114 | for(int i = 0; i < adj[nodCrt].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::DFS_helper(int, std::vector<bool>&)': main.cpp:160:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 160 | for (int i = 0; i < adj[s].size(); i++) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::topological_sort_helper(int, std::vector<bool>&, std::stack<int>&)': main.cpp:196:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 196 | for (int i = 0; i < adj[s].size(); i++) | ~~^~~~~~~~~~~~~~~ main.cpp: In function 'bool exists(std::vector<int>&, int)': main.cpp:220:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 220 | if(first > degrees.size()) ///verificam daca avem suficiente elemente pt pasul urmator, daca nu, atunci nu se verifica algoritmul | ~~~~~~^~~~~~~~~~~~~~~~