POJ Roadblocks 次短路

求次短路，相比最短路多维护一个值就可以了，次短路要么是S->u的最短路+u->v，要么是 S->u次短路+ u->v  第二小的是次短路。

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
const int INF = 999999999;
const int maxn = 5010;
struct edge
{
	int u, v, w;
	edge(){}
	edge(int u, int v, int w) : u(u), v(v), w(w) {}

}a[200010];
int n, m, num;
struct HeapNode
{
	int u, d;
	bool operator < (const HeapNode& rhs) const
	{
		return d > rhs.d;
	}
	HeapNode(){}
	HeapNode(int u, int d) : u(u), d(d) {}
};
vector <edge> edges;
vector <int> G[maxn];
int d[2][maxn];
void Dijkstra()
{
	for(int i = 0; i <= n; i++)
		d[0][i] = d[1][i] = INF;
	d[0][1] = 0;
	priority_queue <HeapNode> Q;
	Q.push(HeapNode(1, 0));
	while(!Q.empty())
	{
		HeapNode x = Q.top(); Q.pop();
		int u = x.u;
		if(x.d > d[1][u])
			continue;
		for(int i = 0; i < G[u].size(); i++)
		{
			edge e = edges[G[u][i]];
			int v = e.v;
			int c = x.d+e.w;
			if(d[0][v] > c)
			{
				swap(d[0][v], c);
				Q.push(HeapNode(v, d[0][v]));
			}
			if(d[0][v] < c && d[1][v] > c)
			{
                d[1][v] = c;
				Q.push(HeapNode(v, d[1][v]));
			}
		}
	}
}
void AddEdge(int u, int v, int w)
{
	edges.push_back(edge(u, v, w));
	edges.push_back(edge(v, u, w));
	num = edges.size();
	G[u].push_back(num-2);
	G[v].push_back(num-1);
}
int main()
{
    while(scanf("%d %d", &n, &m) != EOF)
    {
        num = 0;
        for(int i = 0; i < m; i++)
        {
            int u, v, w;
            scanf("%d %d %d", &u, &v, &w);
            AddEdge(u, v, w);
        }
        Dijkstra();
        printf("%d\n", d[1][n]);
    }
}