108_Roadblock (POJ 3255)

  单源最短路径问题，唯一的区别就是还要次短路径。

  实现的时候用Dijkstra算法的优先队列来实现，先pop出一个，对其所有的邻居更新距离，只要一小于最短或者次短距离，就压到队列里面。

  但优先队列为空时，所有路径更新完毕。

  题源来自《挑战程序竞赛》第二版 109页。

  一下为c++代码：

//
//  108_Roadblocks.cpp
//  changlle
//
//  Created by user on 1/2/16.
//  Copyright (c) 2016 user. All rights reserved.
//

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

struct edge { int u,v,cost;};
typedef pair<int, int> P; //第一个是dist，第二个是num

int main () {
    
    int N=4;
    //int R=4;
    
    int dist[4];
    fill(dist, dist+4,10000);
    dist[0]=0;
    int dist2[4];
    fill(dist2, dist2+4, 10000);
    dist2[0]=0;
    
    vector<edge> G[4];
    
    G[0].push_back(edge{1,2,100});
    G[1].push_back(edge{2,3,250});
    G[1].push_back(edge{2,4,200});
    G[1].push_back(edge{2,1,100});
    G[2].push_back(edge{3,2,250});
    G[2].push_back(edge{3,4,100});
    G[3].push_back(edge{4,3,100});
    G[3].push_back(edge{4,2,200});
    
    priority_queue<P,vector<P>, greater<P>> que;
    que.push(P(0,1));
    
    
    while (!que.empty()) {
        
        P p=que.top(); que.pop();
        int v=p.second, d=p.first;
        
        if (dist2[v-1]<d) continue;
        
        for (int i=0;i<G[v-1].size();i++)
        {
            edge e=G[v-1][i];
            int d_t=e.cost+d;
            if (d_t<dist[e.v-1]) {
                dist[e.v-1]=d_t;
                que.push(P(dist[e.v-1], e.v));
                //cout<<"updata dist"<<endl;
                continue;
            }
            
            if (d_t<dist2[e.v-1]) {
                dist2[e.v-1]=d_t;
                que.push(P(dist2[e.v-1], e.v));
                //cout<<"updatr dist2"<<endl;
            }
            
            
        }
        
  
    }
    
    
    for (int i=0;i<N;i++){
        
        cout<<dist[i]<<"   "<<dist2[i];
        cout<<endl;
        
    }
    
    
    
    
    
    
    
    
    
    return 0;
}