#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int MAXN = 1e5+5;
typedef long long LL;
const LL INF = 0x3f3f3f3f3f3f3f3f;
struct Edge
{
int from, to; LL dist; //起点,终点,距离
Edge(int from, int to, LL dist):from(from), to(to), dist(dist) {}
};
struct Dijkstra
{
int n, m; //结点数,边数(包括反向弧)
vector<Edge> edges; //边表。edges[e]和edges[e^1]互为反向弧
vector<int> G[MAXN]; //邻接表,G[i][j]表示结点i的第j条边在edges数组中的序号
int vis[MAXN]; //标记数组
LL d[MAXN]; //s到各个点的最短路
int p[MAXN]; //上一条弧
void init(int n)
{
this->n = n;
edges.clear();
for (int i = 0; i <= n; i++) G[i].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);
}
struct HeapNode
{
int from; LL dist;
bool operator < (const HeapNode& rhs) const
{
return rhs.dist < dist;
}
HeapNode(int u, LL w): from(u), dist(w) {}
};
void dijkstra(int s)
{
priority_queue<HeapNode> Q;
for (int i = 0; i <= n; i++) d[i] = INF;
memset(vis, 0, sizeof(vis));
d[s] = 0;
Q.push(HeapNode(s, 0));
while (!Q.empty())
{
HeapNode x = Q.top(); Q.pop();
int u = x.from;
if (vis[u]) continue;
vis[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(e.to, d[e.to]));
}
}
}
}
}gao;
解释转码码有问题望见谅参考刘汝佳蓝书
没用优先队列优化的
#include<iostream>
#include<stdio.h>
#include<queue>
#include<string.h>
#include<algorithm>
#include<string>
#include<stack>
#include<vector>
using namespace std;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to, dist; //起点,终点,距离
Edge(int u, int v, int w):from(u), to(v), dist(w) {}
};
struct Dijkstra
{
int n, m; //结点数,边数(包括反向弧)
vector<Edge> edges; //边表。edges[e]和edges[e^1]互为反向弧
vector<int> G[MAXN]; //邻接表,G[i][j]表示结点i的第j条边在edges数组中的序号
int vis[MAXN]; //标记数组
int d[MAXN]; //s到各个点的最短路
int pre[MAXN]; //上一条弧
void init(int n)
{
this->n = n;
edges.clear();
for (int i = 0; i <= n; i++) G[i].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)
{
for (int i = 0; i <= n; i++) d[i] = INF;
d[s] = 0;
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++)
{
int pos, MIN = INF;
for (int j = 1; j <= n; j++)
{
if(!vis[j] && d[j] <= MIN) MIN = d[pos = j];
}
vis[pos] = true;
for (int j = 0; j < G[pos].size(); j++)
{
Edge& e = edges[G[pos][j]];
if (d[e.to] > d[pos] + e.dist)
{
d[e.to] = d[pos] + e.dist;
pre[e.to] = G[pos][j];
}
}
}
}
}gao;