代码转自刘汝佳陈锋编著的算法竞赛入门经典训练指南
比赛的时候把dijkstra写炸了(大雾)……比赛完去看了下书,顺便发到博客上(每次找书好麻烦的)
#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#define INF 0x3f3f3f3f
using namespace std;
const int N=1e5+10;
struct Edge{
int from,to,dist;
Edge(int _from,int _to,int _dist)
{
from=_from,to=_to,dist=_dist;
}
};
struct HeapNode{//Dijkstra算法用到的优先队列的结点
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<Edge>edges;//边列表
vector<int>G[N];//每个结点出发的边编号(0开始)
bool done[N];//是否已永久编号
int d[N];//s到各个点的距离
int p[N];//最短路中的上一条边
void init(int n)
{
this->n=n;
for(int i=0;i<n;i++)G[i].clear();
edges.clear();
}
void addedge(int from,int to,int dist)
{
edges.push_back(Edge(from,to,dist));
m=edges.size();
G[from].push_back(m-1);
}
void dijkstra(int s)//s到其他点的最短距离
{
priority_queue<HeapNode>q;
for(int i=0;i<n;i++)d[i]=INF;
d[s]=0;
memset(done,0,sizeof(done));
q.push(HeapNode(0,s));
while(!q.empty())
{
HeapNode x=q.top();
q.pop();
int u=x.u;
if(done[u])continue;
done[u]=true;
for(int i=0;i<G[u].size();i++)
{
Edge& e=edges[G[u][i]];
if(d[e.to]>d[u]+e.dist)
{
d[e.to]=d[u]+e.dist;
p[e.to]=G[u][i];
q.push(HeapNode(d[e.to],e.to));
}
}
}
}
};
int main()
{
return 0;
}