Compilare: main.cpp: In constructor 'Graph::Graph(int, std::vector<std::vector<int> >&)': main.cpp:32:25: warning: 'Graph::graph' will be initialized after [-Wreorder] 32 | vector<vector<int>> graph; // Lista de adiacență | ^~~~~ main.cpp:31:17: warning: 'std::vector<int> Graph::dplus' [-Wreorder] 31 | vector<int> dplus; // grad + (degree +) | ^~~~~ main.cpp:48:5: warning: when initialized here [-Wreorder] 48 | Graph(int numCourses, vector<vector<int>>& prerequisites) : n(numCourses), graph(numCourses), dplus(numCourses, 0) { | ^~~~~ main.cpp: In constructor 'Graph::Graph(int, std::vector<std::vector<int> >&, std::string)': main.cpp:30:9: warning: 'Graph::n' will be initialized after [-Wreorder] 30 | int n,m,pl, pc, cl, cc,k; | ^ main.cpp:28:27: warning: 'std::vector<int> Graph::recursie' [-Wreorder] 28 | vector<int> color,dfs,recursie; ///Nestiut = -1 , A = 0 ,B=0 | ^~~~~~~~ main.cpp:72:5: warning: when initialized here [-Wreorder] 72 | Graph(int n, vector<vector<int>>& connections , string aux) :n(n),recursie(n,0) ,graph(n), visitat(n, false) { | ^~~~~ main.cpp:32:25: warning: 'Graph::graph' will be initialized after [-Wreorder] 32 | vector<vector<int>> graph; // Lista de adiacență | ^~~~~ main.cpp:29:18: warning: 'std::vector<bool> Graph::visitat' [-Wreorder] 29 | vector<bool> visitat; | ^~~~~~~ main.cpp:72:5: warning: when initialized here [-Wreorder] 72 | Graph(int n, vector<vector<int>>& connections , string aux) :n(n),recursie(n,0) ,graph(n), visitat(n, false) { | ^~~~~ main.cpp: In constructor 'Graph::Graph(int, int, int)': main.cpp:30:28: warning: 'Graph::k' will be initialized after [-Wreorder] 30 | int n,m,pl, pc, cl, cc,k; | ^ main.cpp:30:9: warning: 'int Graph::n' [-Wreorder] 30 | int n,m,pl, pc, cl, cc,k; | ^ main.cpp:97:5: warning: when initialized here [-Wreorder] 97 | Graph(int n,int m,int k) :m(m),k(k), n(n),patrole(n + 1, vector<int>(420, 0)),adj(n+1),dp(n+1,vector<int>(420, -1)) { | ^~~~~ main.cpp:43:25: warning: 'Graph::patrole' will be initialized after [-Wreorder] 43 | vector<vector<int>> patrole; | ^~~~~~~ main.cpp:42:25: warning: 'std::vector<std::vector<int> > Graph::adj' [-Wreorder] 42 | vector<vector<int>> adj; | ^~~ main.cpp:97:5: warning: when initialized here [-Wreorder] 97 | Graph(int n,int m,int k) :m(m),k(k), n(n),patrole(n + 1, vector<int>(420, 0)),adj(n+1),dp(n+1,vector<int>(420, -1)) { | ^~~~~ main.cpp: In member function 'std::vector<int> Graph::topologicalSort()': main.cpp:176:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]