Eroare de compilare: main.cpp:163: warning: ignoring '#pragma region Definitions' [-Wunknown-pragmas] 163 | #pragma region Definitions | main.cpp:966: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 966 | #pragma endregion | main.cpp:985: warning: ignoring '#pragma region Public_Methods_Calls' [-Wunknown-pragmas] 985 | #pragma region Public_Methods_Calls | main.cpp:1144: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 1144 | #pragma endregion | main.cpp: In constructor 'Graph::Graph(int, int, bool, bool, bool)': main.cpp:73:9: warning: 'Graph::nrEdges' will be initialized after [-Wreorder] 73 | int nrEdges; | ^~~~~~~ main.cpp:68:10: warning: 'bool Graph::isDirected' [-Wreorder] 68 | bool isDirected; | ^~~~~~~~~~ main.cpp:80:5: warning: when initialized here [-Wreorder] 80 | Graph(int n = 0, int m = 0, bool d = false, bool w = false, bool f = false) : nrNodes(n), nrEdges(m), isDirected(d), isWeighted(w), isFlowing(f) {} | ^~~~~ main.cpp: In member function 'void Graph::removeEdge(int, int)': main.cpp:337:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 337 | for (int i = 0; i < adjacencyList[src].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:342:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 342 | for (int i = 0; i < adjacencyList[dst].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::getEulerCycle()': main.cpp:610:29: error: void value not ignored as it ought to be 610 | int k = EulerianCycleDFS(1, isVisitedEdge, EClist); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::TarjanDFS(int, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<bool>&, std::vector<std::vector<int> >&)': main.cpp:664:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else] 664 | if (discOrder[edge.dest]) // if the adjacent node had been processed and is part of the current traversal path | ^ main.cpp: In member function 'void Graph::HavelHakimi(std::vector<int>&, bool&)': main.cpp:775:24: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 775 | if (degrees[0] > degrees.size() - 1) main.cpp: In function 'int main()': main.cpp:973:23: warning: unused variable 'start' [-Wunused-variable] 973 | int nodes, edges, start, operations; | ^~~~~ main.cpp:973:30: warning: unused variable 'operations' [-Wunused-variable] 973 | int nodes, edges, start, operations; | ^~~~~~~~~~ Non zero exit status: 1