Compilare: main.cpp:147: warning: ignoring '#pragma region Utilitary_Functions' [-Wunknown-pragmas] 147 | #pragma region Utilitary_Functions | main.cpp:643: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 643 | #pragma endregion | main.cpp:658: warning: ignoring '#pragma region Public_Methods_Calls' [-Wunknown-pragmas] 658 | #pragma region Public_Methods_Calls | main.cpp:792: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas] 792 | #pragma endregion | main.cpp: In constructor 'Edge::Edge(bool, bool)': main.cpp:33:9: warning: 'Edge::cap' will be initialized after [-Wreorder] 33 | int cap; | ^~~ main.cpp:26:10: warning: 'bool Edge::isWeighted' [-Wreorder] 26 | bool isWeighted; | ^~~~~~~~~~ main.cpp:35:5: warning: when initialized here [-Wreorder] 35 | Edge(bool w = false, bool f = false) : src(0), dest(0), cost(0), cap(0), isWeighted(w), isFlowing(f) {} | ^~~~ main.cpp: In constructor 'Edge::Edge(int, int, int, int)': main.cpp:33:9: warning: 'Edge::cap' will be initialized after [-Wreorder] 33 | int cap; | ^~~ main.cpp:26:10: warning: 'bool Edge::isWeighted' [-Wreorder] 26 | bool isWeighted; | ^~~~~~~~~~ main.cpp:36:5: warning: when initialized here [-Wreorder] 36 | Edge(int s, int d, int c = 0, int g = 0) : src(s), dest(d), cost(c), cap(g), isWeighted(false), isFlowing(false) {} | ^~~~ main.cpp: In constructor 'Graph::Graph(int, int, bool, bool, bool)': main.cpp:79:9: warning: 'Graph::nrEdges' will be initialized after [-Wreorder] 79 | int nrEdges; | ^~~~~~~ main.cpp:74:10: warning: 'bool Graph::isDirected' [-Wreorder] 74 | bool isDirected; | ^~~~~~~~~~ main.cpp:86:5: warning: when initialized here [-Wreorder] 86 | 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::TarjanDFS(int, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<bool>&, std::__cxx11::list<std::set<int> >&)': main.cpp:402:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else] 402 | 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:513: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] 513 | if (degrees[0] > degrees.size() - 1) main.cpp: In member function 'void Graph::Dijkstra(int, std::vector<int>&)':