Compilare: main.cpp: In member function 'void Graph::bfs(int)': main.cpp:199:37: warning: unused variable 'nodeDegree' [-Wunused-variable] 199 | int visitedNodes[100000] = {0}, nodeDegree[100000] = {0}; | ^~~~~~~~~~ main.cpp:200:9: warning: unused variable 'distance' [-Wunused-variable] 200 | int distance[100000] = {0}; | ^~~~~~~~ main.cpp: In member function 'void Graph::topologicalSort()': main.cpp:264:9: warning: unused variable 'visitedNodes' [-Wunused-variable] 264 | int visitedNodes[100000] = {0}, nodeDegree[100000] = {0}; | ^~~~~~~~~~~~ main.cpp: In member function 'bool Graph::checkHavelHakimi(std::vector<int>&)': main.cpp:324:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 324 | if(lastElement > nodeDegrees.size() - 1) { | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:330:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 330 | for(int i = nodeDegrees.size() - 1; i > nodeDegrees.size() - 1 - lastElement ; i--) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~