HDU2544-最短路-dijikstra板子

#include <cmath>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct edge{
    int next,v,w;
    edge(int next=0,int v=0,int w=0):next(next),v(v),w(w){}
};

const int MAXN=105,MAXM=10005;

int head[MAXN],cnt;edge e[MAXM*2];
void init_G(){cnt=0,memset(head,0,sizeof(head)),memset(e,0,sizeof(e));}

void add(int u,int v,int w){
    e[++cnt]=edge(head[u],v,w),head[u]=cnt;
    e[++cnt]=edge(head[v],u,w),head[v]=cnt;
}

struct node{
    int dis,u;
    bool operator<(const node NEXT)const{return dis<NEXT.dis;}
    node(int dis=0,int u=0):dis(dis),u(u){}
};

int d[MAXN];void init_d(int n){for(int i=1;i<=n;i++)d[i]=1e9;}

int dijkstra(int s,int t){
    init_d(t);
    priority_queue<node>q;
    d[s]=0,q.push(node(0,s));
    for(int u,v;!q.empty();){
        u=q.top().u,q.pop();
        for(int i=head[u];i;i=e[i].next){
            v=e[i].v;
            if(d[v]>d[u]+e[i].w) {
                d[v]=d[u]+e[i].w;
                q.push(node(d[v],v));
            }
        }
        
    }
    return d[t];
}

int main(){
    for(int n,m;scanf("%d%d",&n,&m),n+m;){
        init_G();
        for(int i=1,A,B,C;i<=m;i++)cin>>A>>B>>C,add(A,B,C);            
        cout<<dijkstra(1,n)<<endl;
    }
    return 0;
}

有些没用的板子！

#include <cmath>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct point{
    int a,b;
    point(int a=0,int b=0):a(a),b(b){}
    bool operator<(const point NEXT)const{return (a==NEXT.a)?(b<NEXT.b):(a<NEXT.a);}
    void out(){printf("(%d,%d)",a,b);}
};

bool comp(point A,point B){return (A.a==B.a)?(A.b>B.b):(A.a<B.a);}

void sortForTwoSet(){
    point A[5]={point(1,2),point(1,4),point(2,5),point(3,5),point(1,3)};
    sort(A,A+5,comp);
    for(int i=0;i<5;i++){A[i].out();cout<<" ";}
}

struct edge{
    int next,v,w;
    edge(int next=0,int v=0,int w=0):next(next),v(v),w(w){}
};

const int MAXN=105,MAXM=10005;

int head[MAXN],cnt;
edge e[MAXM*2];

void init_G(){
    cnt=0,memset(head,0,sizeof(head));
    memset(e,0,sizeof(e));
}

void add(int u,int v,int w){
    e[++cnt]=edge(head[u],v,w),head[u]=cnt;
    e[++cnt]=edge(head[v],u,w),head[v]=cnt;
}

struct node{
    int dis,u;
    bool operator<(const node NEXT)const{return dis<NEXT.dis;}
    node(int dis=0,int u=0):dis(dis),u(u){} 
    //优先队列默认大根堆，要反过来才是小根堆 
};

int d[MAXN];void init_d(int n){for(int i=1;i<=n;i++)d[i]=1e9;}
typedef pair<int,int> P;

int dijkstra(int s,int t){
    init_d(t);
    priority_queue<node>q;//priority_queue<P,vector<P>,greater<P> >q;//第一维度为距离，第二维度为点     
    d[s]=0,q.push(node(0,s));//d[s]=0,q.push(make_pair(0,s));
    for(int u,v;!q.empty();){
        u=q.top().u,q.pop();//u=q.top().second,q.pop();
        for(int i=head[u];i;i=e[i].next){
            v=e[i].v;
            if(d[v]>d[u]+e[i].w) {
                d[v]=d[u]+e[i].w;
                q.push(node(d[v],v));//q.push(make_pair(d[v],v));
            }
        }
        
    }
    return d[t];
}

int main(){
    for(int n,m;scanf("%d%d",&n,&m),n+m;){
        init_G();
        for(int i=1,A,B,C;i<=m;i++)cin>>A>>B>>C,add(A,B,C);            
        cout<<dijkstra(1,n)<<endl;
    }
    return 0;
}