Compilare: main.cpp: In member function 'std::vector<std::__cxx11::list<Graph::nodeStruct> > Graph::transposed()': main.cpp:21:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 21 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In constructor 'Graph::Graph(std::vector<std::tuple<int, int, int> >&, int, bool)': main.cpp:102:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' 102 | for(auto[node1, node2, cost]: data) { | ^ main.cpp: In function 'std::ostream& operator<<(std::ostream&, Graph)': main.cpp:111:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 111 | for(int i = 0; i < graph.adjacent.size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::connected()': main.cpp:122:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 122 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::stack<int> Graph::topologicalSort()': main.cpp:141:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 141 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::pair<std::vector<std::vector<int> >, std::vector<std::pair<int, int> > > Graph::biconnected()': main.cpp:152:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 152 | for (int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > Graph::hardConnected()': main.cpp:162:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 162 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra(int)': main.cpp:180:13: warning: unused variable 'cost' [-Wunused-variable] 180 | int cost = 0; | ^~~~ main.cpp: In member function 'std::pair<std::vector<int>, bool> Graph::bellmanFord(int)': main.cpp:210:41: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 210 | if(visited[i.node2] >= adjacent.size()) main.cpp: In member function 'std::pair<std::vector<Graph::nodeStruct>, int> Graph::minimumTreeKruskall()': main.cpp:223:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 223 | for(int i = 0; i < parents.size(); i++) | ~~^~~~~~~~~~~~~~~~ main.cpp:225:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::list<Graph::nodeStruct> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 225 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:290:25: warning: unused variable 'cost' [-Wunused-variable] 290 | int aux1, aux2, cost; | ^~~~