记录最短路的dijkstra算法学习
P4779 【模板】单源最短路径(标准版)原题链接
链式前向星
题目描述
给定一个 n个点,m条有向边的带非负权图,请你计算从 s 出发,到每个点的距离。 数据保证你能从 s 出发到任意点。输入格式
第一行为三个正整数 n, m, s。 第二行起 m 行,每行三个非负整数 ui, vi, wi表示从ui到 vi有一条权值为wi的有向边。输出格式
输出一行 nn 个空格分隔的非负整数,表示 ss 到每个点的距离。输入输出样例
输入
4 6 1
1 2 2
2 3 2
2 4 1
1 3 5
3 4 3
1 4 4
输出
0 2 4 3
/**
**最短路的dijkstra算法
**堆优化
**/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1000005;
const ll INF = 0x7fffffff;
struct edge {
int to, w, next;
}e[maxn];
int head[maxn], vis[maxn];
int cnt;
void add(int u, int v, int w) {
e[++cnt].to = v;
e[cnt].w = w;
e[cnt].next = head[u];
head[u] = cnt;
}
struct node {
int d, u;
node(int a, int b) { d = a; u = b; }
bool operator <(const node& x)const {
return x.d < d;
}
};
int dis[maxn];
void dijkstra(int n, int s) {
//memset(vis,0,sizeof(vis));
for (int i = 1; i <= n; i++)dis[i] = INF;
dis[s] = 0;
priority_queue<node>q;
q.push(node(dis[s],s));
while (!q.empty()) {
node temp = q.top();
q.pop();
int u = temp.u;
if (vis[u])continue;
vis[u] = 1;
for (int i = head[u]; i; i = e[i].next) {
int v = e[i].to;
if (dis[v] > dis[u] + e[i].w) {
dis[v] = dis[u] + e[i].w;
q.push(node(dis[v], v));
}
}
}
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, m, s;
cin >> n >> m >> s;
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
add(u, v, w);
//add(v,u,w);
}
dijkstra(n, s);
for (int i = 1; i <= n; i++)cout << dis[i] << " ";
return 0;
}
/*
注这里的代码
typedef pair<int,int> pii;
priority_queue<pii,vector<pii>,greater<pii> > q;
等同于
struct heapnode{
int d,u;
bool operator < (const heapnode& rhs)const{
return d>rhs.d;
}
};
紫书P361上有说明
*/
——————————————————————分割线
HDU2544最短路原题链接
使用邻接表+优先队列
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e3 + 5;
const ll INF = 0x7fffffff;
struct edge {
int from, to, w;
edge(int a, int b, int c) { from = a; to = b; w = c; }
};
vector<edge>e[maxn];
struct node {
int id, n_dis;
node(int n, int d) { id = n; n_dis = d; }
bool operator<(const node& x)const {
return n_dis > x.n_dis;
}
};
int n, m;
void dijkstra() {
int dis[maxn];
bool vis[maxn];
for (int i = 1; i <= n; i++) {
dis[i] = INF;
vis[i] = false;
}
int s = 1;
dis[s] = 0;
priority_queue<node>q;
q.push(node{ s,dis[s] });
while (!q.empty()) {
node u = q.top();
q.pop();
if (vis[u.id])continue;
vis[u.id] = 1;
//选一条边若从s点到边的终点的距离(初始化为INF)
//比从s点到边的起点+边的权重下则加入
for (int i = 0; i < e[u.id].size(); i++) {
edge t = e[u.id][i];
if (vis[t.to])continue;
if (dis[t.to] > t.w + u.n_dis) {//这里u.n_dis=dis[u.id]
dis[t.to] = t.w + u.n_dis;
q.push(node(t.to, dis[t.to]));
}
}
}
cout << dis[n] << "\n";
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
while (cin >> n >> m) {
if (n == 0 && m == 0)return 0;
for (int i = 1; i <= n; i++)e[i].clear();
while (m--) {
int u, v, w;
cin >> u >> v >> w;
e[u].push_back(edge(u, v, w));
e[v].push_back(edge(v, u, w));
}
dijkstra();
}
return 0;
}