Dijkstra+heap

#include<iostream>#include<queue>#include<vector>using namespace std;#define INF 0x3f3f3fconst int maxn = 101;int g[maxn][maxn];int vis[maxn];int dis[maxn];struct node{ int t, w; node( int tt, int ww) : t(tt), w(ww){} bool operator < (const node & o) const {return w > o.w;}};vector<int> edges[maxn];void init(int E){ for(int i=0; i<E; i++) edges[i].clear(); memset(g, INF, sizeof(g)); memset(dis, INF, sizeof(dis)); memset(vis, 0, sizeof(vis));}void dijkstra(int src){ dis[src] = 0; //vis[src] = 1; priority_queue<node> Q; Q.push(node(src, 0)); while(!Q.empty()) { node curNode = Q.top(); Q.pop(); int u = curNode.t; vis[u] = 1; for(int i=0; i<edges[u].size(); i++) { int v = edges[u][i]; if( !vis[v] && dis[v] > dis[u] + g[u][v]) { dis[v] = dis[u] + g[u][v]; Q.push(node(v, dis[v])); } } while(!Q.empty() && vis[Q.top().t]==1) Q.pop(); if(Q.empty()) break; }}int main(){ int V, E; while(scanf("%d%d", &V, &E)!=EOF) { if(V==0) break; init(E); int f, t, w; for(int i=0; i<E; i++) { scanf("%d%d%d", &f, &t, &w); g[f][t] = w; edges[f].push_back(t); } dijkstra(1); for(i=1; i<=V; i++) { printf("%d ", dis[i]); } printf("/n"); } return 0;}