POJ 2387 Til the Cows Come Home(Dijkstra简单题)

POJ 2387 Til the Cows Come Home(Dijkstra简单题)

http://poj.org/problem?id=2387

题意:

        有N个顶点和T条边的无向图,现在要问你从1号顶点到N号顶点的最短距离是多少?

分析:  

        直接通刘汝佳的Dijkstra模板,不过注意题中可能有重边.(不过不影响)

AC代码:

#include
#include
#include
#include
#include
using namespace std;
const int maxn=1000+10;
const int maxm=2000+10;
int n,m;
struct Edge
{
    int from,to,dist;
    Edge(int f,int t,int d):from(f),to(t),dist(d){}
};

struct HeapNode
{
    int d,u;
    HeapNode(int d,int u):d(d),u(u){}
    bool operator < (const HeapNode &rhs) const
    {
        return d > rhs.d;
    }
};

struct Dijkstra
{
    int n,m;
    vector edges;
    vector G[maxn];
    bool done[maxn];
    int d[maxn];

    void init(int n)
    {
        this->n = n;
        for(int i=0;i Q;
        for(int i=0;i d[u]+e.dist)
                {
                    d[e.to] = d[u]+e.dist;
                    Q.push(HeapNode(d[e.to],e.to));
                }
            }
        }
        return d[n-1];
    }
}DJ;

int main()
{
    while(scanf("%d%d",&m,&n)==2)
    {
        DJ.init(n);
        for(int i=0;i