Compilare: main.cpp: In function 'std::vector<int> shortest_path_Dijkstra(const std::vector<std::vector<std::pair<int, int> > >&, int)': main.cpp:6:21: warning: integer overflow in expression [-Woverflow] #define INF (1<<31) - 1 ~~~~~~~~^~~ main.cpp:22:45: note: in expansion of macro 'INF' std::vector<int> dist(graph.size() + 1, INF); ^~~ main.cpp:30:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < graph[act.first].size(); i++) { ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:6:21: warning: integer overflow in expression [-Woverflow] #define INF (1<<31) - 1 ~~~~~~~~^~~ main.cpp:31:47: note: in expansion of macro 'INF' if (graph[act.first][i].second != INF && viz[graph[act.first][i].first] == 0) { ^~~ main.cpp: In function 'int main()': main.cpp:58:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 1; i < graf.size(); i++) { ~~^~~~~~~~~~~~~ main.cpp:60:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j = 0; j < graf[i].size(); j++) { ~~^~~~~~~~~~~~~~~~ main.cpp:66:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 1; i < dist.size(); i++) { ~~^~~~~~~~~~~~~ main.cpp:6:21: warning: integer overflow in expression [-Woverflow] #define INF (1<<31) - 1 ~~~~~~~~^~~ main.cpp:67:37: note: in expansion of macro 'INF' if(i != start && dist[i] != INF) ^~~ main.cpp:67:23: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized] if(i != start && dist[i] != INF) ^