Compilare: user.cpp: In function ‘int af(int)’: user.cpp:8:239: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] using namespace std;ifstream f("camionas.in");ofstream g("camionas.out");priority_queue < p, vector< p >, greater< p > > h;vector< p >v[NMAX];int d[NMAX],n,m,G,i,a,b,x,j,nod;int af(int nod){int i;if(nod==1)return 0;for (i=0;i<v[nod].size();i++){if(d[nod] - v[nod][i].f == d[v[nod][i].s]){if(v[nod][i].f==NMAX)return 1 + af(v[nod][i].s);return af(v[nod][i].s);}}}int main(){f>>n>>m>>G;for(i=1;i<=m;i++){f>>a>>b>>x;if(x<G) x=NMAX;else x=1;v[a].push_back(mp(x, b));v[b].push_back(mp(x, a));}for(i=1;i<=n;i++)d[i]=INF;h.push(mp(0,1));d[1]=0;while(!h.empty()){nod = h.top().s;h.pop();for(i=0;i<v[nod].size();i++){if(d[nod] + v[nod][i].f < d[v[nod][i].s]){d[v[nod][i].s] = d[nod] + v[nod][i].f;h.push(mp(d[v[nod][i].s], v[nod][i].s));}}}g<<af(n);} ^ user.cpp: In function ‘int main()’: user.cpp:8:602: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] using namespace std;ifstream f("camionas.in");ofstream g("camionas.out");priority_queue < p, vector< p >, greater< p > > h;vector< p >v[NMAX];int d[NMAX],n,m,G,i,a,b,x,j,nod;int af(int nod){int i;if(nod==1)return 0;for (i=0;i<v[nod].size();i++){if(d[nod] - v[nod][i].f == d[v[nod][i].s]){if(v[nod][i].f==NMAX)return 1 + af(v[nod][i].s);return af(v[nod][i].s);}}}int main(){f>>n>>m>>G;for(i=1;i<=m;i++){f>>a>>b>>x;if(x<G) x=NMAX;else x=1;v[a].push_back(mp(x, b));v[b].push_back(mp(x, a));}for(i=1;i<=n;i++)d[i]=INF;h.push(mp(0,1));d[1]=0;while(!h.empty()){nod = h.top().s;h.pop();for(i=0;i<v[nod].size();i++){if(d[nod] + v[nod][i].f < d[v[nod][i].s]){d[v[nod][i].s] = d[nod] + v[nod][i].f;h.push(mp(d[v[nod][i].s], v[nod][i].s));}}}g<<af(n);} ^ user.cpp: In function ‘int af(int)’: user.cpp:8:362: warning: control reaches end of non-void function [-Wreturn-type] using namespace std;ifstream f("camionas.in");ofstream g("camionas.out");priority_queue < p, vector< p >, greater< p > > h;vector< p >v[NMAX];int d[NMAX],n,m,G,i,a,b,x,j,nod;int af(int nod){int i;if(nod==1)return 0;for (i=0;i<v[nod].size();i++){if(d[nod] - v[nod][i].f == d[v[nod][i].s]){if(v[nod][i].f==NMAX)return 1 + af(v[nod][i].s);return af(v[nod][i].s);}}}int main(){f>>n>>m>>G;for(i=1;i<=m;i++){f>>a>>b>>x;if(x<G) x=NMAX;else x=1;v[a].push_back(mp(x, b));v[b].push_back(mp(x, a));}for(i=1;i<=n;i++)d[i]=INF;h.push(mp(0,1));d[1]=0;while(!h.empty()){nod = h.top().s;h.pop();for(i=0;i<v[nod].size();i++){if(d[nod] + v[nod][i].f < d[v[nod][i].s]){d[v[nod][i].s] = d[nod] + v[nod][i].f;h.push(mp(d[v[nod][i].s], v[nod][i].s));}}}g<<af(n);} ^