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:100:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' 100 | for(auto[node1, node2, cost]: data) { | ^ main.cpp: In function 'std::ostream& operator<<(std::ostream&, Graph)': main.cpp:109: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] 109 | for(int i = 0; i < graph.adjacent.size(); i++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::connected()': main.cpp:120: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] 120 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::stack<int> Graph::topologicalSort()': main.cpp:138: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] 138 | 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:149: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] 149 | for (int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::vector<int> > Graph::hardConnected()': main.cpp:159: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] 159 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra(int)': main.cpp:177:13: warning: unused variable 'cost' [-Wunused-variable] 177 | int cost = 0; | ^~~~ main.cpp: In member function 'std::pair<std::vector<int>, bool> Graph::bellmanFord(int)': main.cpp:207: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] 207 | if(visited[i.node2] >= adjacent.size()) main.cpp: In member function 'std::pair<std::vector<Graph::nodeStruct>, int> Graph::minimumTreeKruskall()': main.cpp:220:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 220 | for(int i = 0; i < parents.size(); i++) | ~~^~~~~~~~~~~~~~~~ main.cpp:222: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] 222 | for(int i = 0; i < adjacent.size(); i++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::diameter()': main.cpp:242:13: warning: unused variable 'current' [-Wunused-variable] 242 | int current; | ^~~~~~~