Compilare: main.cpp:949:5: warning: "/*" within comment [-Wcomment] 949 | /* | main.cpp: In member function 'void Graph::printGraph()': main.cpp:159:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 159 | for(int j = 0; j < adlist[i].size(); ++j) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'Graph Graph::transpose()': main.cpp:295:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 295 | for(j = 0; j < adlist[i].size(); ++j) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::stronglyConnectedComponents(bool*, int&, std::vector<std::vector<int> >&)': main.cpp:330:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 330 | for(j = 0; j < comp[i].size(); ++j) | ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::graphExistsHakimi(std::vector<int>&, int)': main.cpp:366:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 366 | if(degree > dg.size())//check if enough elements are in the list | ~~~~~~~^~~~~~~~~~~ main.cpp:369:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 369 | for(int i = 0; i < dg.size(); ++i) //substract 1 from the following | ~~^~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > Graph::criticalConnections(int, std::vector<std::vector<int> >&)': main.cpp:423:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 423 | for(int i = 0; i < connections.size(); ++i)//for each edge | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::kruskal()': main.cpp:478:41: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 478 | for(int i = 1; i <= m && sol.size() != n-1; ++i)//for each edge until we choose n-1 | ~~~~~~~~~~~^~~~~~ main.cpp:493:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 493 | for(int i = 0; i < sol.size(); ++i) | ~~^~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra()': main.cpp:556:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 556 | for(int i = 0; i < adj_cost[node].size(); ++i)//for all nodes that "node" is connected to | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::bellmanford()': main.cpp:620:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 620 | for(int i = 0; i < adj_cost[node].size(); ++i) //for each neighbour | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::Euler()': main.cpp:850:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 850 | for(int i = 0; i < euler_cicle.size() - 1; ++i) | ~~^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'void solveConnectedComponents()': main.cpp:1017:10: warning: unused variable 'viz' [-Wunused-variable] 1017 | bool viz[N] = {0}; | ^~~ main.cpp: In function 'void solveBiconnectedComponents()':