1.自然语言描述
dijkstra 算法是一种计算正权边单源最短路径的算法。每次从点集V中挑出距离源点最近的点,再对该点的所有邻接点距离源点的长度进行更新。dijkstra 实现可以用一般的朴素做法(复杂度O(n^2))和堆优化做法(复杂度O(nlogn))
2.代码实现
题目:Acwing.849 dijkstra求最短路径I题目链接
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=510;
int g[MAXN][MAXN],n,m,dist[MAXN];
bool st[MAXN];
int dijkstra()
{
memset(dist,0x3f,sizeof(dist));
dist[1]=0;
for(int i=1;i<=n;i++){
int t=-1;
for(int j=1;j<=n;j++)//找出当前距离源点最近的点t
if(!st[j]&&(t==-1||dist[t]>dist[j]))
t=j;
st[t]=true;
for(int j=1;j<=n;j++)//更新与t邻接的所有点
dist[j]=min(dist[j],dist[t]+g[t][j]);
}
if(dist[n]>=0x3f3f3f3f/2)
return -1;
return dist[n];
}
int main(void)
{
cin>>n>>m;
memset(g,0x3f,sizeof(g));
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
g[a][b]=min(g[a][b],c);
}
cout<<dijkstra()<<endl;
return 0;
}
题目:Acwing.850 dijkstra求最短路径II题目链接
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int MAXN=2e5+10;
typedef pair<int,int> PII;
int n,m,h[MAXN],e[MAXN*2],ne[MAXN*2],w[MAXN*2],idx;
int dist[MAXN];
bool st[MAXN];
void add(int a,int b,int c)
{
e[idx]=b;
ne[idx]=h[a];
w[idx]=c;
h[a]=idx++;
}
int dijkstra()
{
priority_queue<PII,vector<PII>,greater<PII> > heap;//小顶堆
heap.push({0,1});//优先队列按照first进行排序
memset(dist,0x3f,sizeof(dist));
dist[1]=0;
while(!heap.empty()){
auto t=heap.top();
heap.pop();
int ver=t.second,distance=t.first;
if(st[ver])
continue;
st[ver]=true;
for(int i=h[ver];i!=-1;i=ne[i]){//更新所有和t邻接的点
int j=e[i];
if(dist[j]>distance+w[i]){
dist[j]=distance+w[i];
heap.push({dist[j],j});
}
}
}
if(dist[n]>=0x3f3f3f3f/2)
return -1;
return dist[n];
}
int main(void)
{
cin>>n>>m;
memset(h,-1,sizeof(h));
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
add(a,b,c);
}
cout<<dijkstra()<<endl;
return 0;
}