DIjkstra1(对于稠密图)
对于稠密图我们一般采用临界矩阵来存图,以下是代码模板,时间复杂度 O ( n 2 + m ) O(n^2+m) O(n2+m)
//适用于稠密图,时间复杂度O(n^2+m),边n^2,点n,m次操作
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 510;
int g[N][N];//存图中点的距离
int dist[N];//存到起点的距离
bool st[N];//记录当前点的最短路是否找到
int n, m;//n是点数,m是边数
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++)
{
if(!st[j] && (t == -1 || dist[t] > dist[j]))
t = j;
}
st[t] = true;
for(int j = 1; j <= n; j++)
{
dist[j] = min(dist[t] + g[t][j], dist[j]);
}
}
if(dist[n] == 0x3f3f3f3f) return -1;
//注意memset每次是对一个字节进行操作,前面初始化的最大值就是4个0x3f即0x3f3f3f3f故而这边比较的时候也要和之前设置的无穷大一样
else return dist[n];
}
int main()
{
scanf("%d%d", &n, &m);
memset(g, 0x3f, sizeof g);
while(m--)
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
g[a][b] = min(g[a][b], c);//对重边的处理,取最小
}
int t = dijkstra();
printf("%d", t);
return 0;
}
Dijkstra2(对于稀疏图)
对于稀疏图我们的存图方式是用邻接矩阵来存储我们的图,我这是用数组的形式(链式前向星)来存储,并用堆来维护,时间复杂度 O ( m l o g n ) O(mlogn) O(mlogn)
//使用于稀疏图,边与点的比值较小时(如1:1)
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
typedef pair<int, int> PII;
const int N = 150010;
int e[N], ne[N], w[N], h[N], idx;
//邻接表e[N]是指向的值,ne[N]是该点指向下一个值的位置,w[N]是权重,h[N]是队头,idx是索引
int dist[N];
bool st[N];
int n, m;
void add(int a, int b, int c)
{
e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
}
int dijkstra()
{
memset(dist, 0x3f, sizeof dist);
dist[1] = 0;
priority_queue<PII, vector<PII>, greater<PII>> heap;
heap.push({0, 1});
while(heap.size())
{
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])
{
int j = e[i];
if(dist[j] > distance + w[i])
{
dist[j] = distance + w[i];
heap.push({dist[j], j});
}
}
}
if(dist[n] == 0x3f3f3f3f) return -1;
else return dist[n];
}
int main()
{
scanf("%d%d", &n, &m);
memset(h, -1, sizeof h);
while(m--)
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
add(a, b, c);
}
int t = dijkstra();
printf("%d", t);
return 0;
}