Compilare: main.cpp: In member function 'void Graph::add_edge(int, int, int, ld)': main.cpp:42:33: warning: narrowing conversion of '(&((Graph*)this)->Graph::g.std::vector<_Tp, _Alloc>::operator[]<std::vector<Graph::Edge>, std::allocator<std::vector<Graph::Edge> > >(((std::vector<std::vector<Graph::Edge> >::size_type)y)))->std::vector<_Tp, _Alloc>::size<Graph::Edge, std::allocator<Graph::Edge> >()' from 'std::vector<Graph::Edge>::size_type {aka long unsigned int}' to 'int' inside { } [-Wnarrowing] g[x].push_back({y, g[y].size(), 0, cap, cost}); ~~~~~~~~~^~ main.cpp:43:36: warning: narrowing conversion of '((&((Graph*)this)->Graph::g.std::vector<_Tp, _Alloc>::operator[]<std::vector<Graph::Edge>, std::allocator<std::vector<Graph::Edge> > >(((std::vector<std::vector<Graph::Edge> >::size_type)x)))->std::vector<_Tp, _Alloc>::size<Graph::Edge, std::allocator<Graph::Edge> >() - 1ul)' from 'std::vector<Graph::Edge>::size_type {aka long unsigned int}' to 'int' inside { } [-Wnarrowing] g[y].push_back({x, g[x].size() - 1, 0, 0, -cost}); ~~~~~~~~~~~~^~~ main.cpp: In member function 'void Graph::bellman()': main.cpp:59:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0; h < g[node].size(); h++) { ~~^~~~~~~~~~~~~~~~ main.cpp: In member function 'std::pair<int, long double> Graph::dijkstra()': main.cpp:90:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int h = 0; h < g[node].size(); h++) { ~~^~~~~~~~~~~~~~~~ main.cpp:107:11: warning: unused variable 'start' [-Wunused-variable] int start = sink; ^~~~~