dijkstra + 小顶堆优化
1、不能处理带有负边的图
2、优先队列默认大顶堆
3、如果说两个点之间有多条路,这是没有影响的
题目描述:求
s
s
s 到
t
t
t 的最短路,若不存在,返回
−
1
-1
−1
题目来源:hdu1874畅通工程续
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int maxn = 200 + 10;
const int maxm = 1000 + 10;
const int inf = 0x3f3f3f3f;
struct node{
int to, w, next;
}e[maxn*2];
int head[maxn], cnt;
int d[maxn];;
int n ,m;
void addedge(int u,int v,int w){
e[cnt].to = v; e[cnt].w = w;
e[cnt].next = head[u]; head[u] = cnt++;
}
void init(){
cnt = 0;
memset(head, -1, sizeof head);
memset(e, 0, sizeof e);
}
int dijkstra(int s,int t){
memset(d, 0x3f, sizeof d);
d[s] = 0;
priority_queue<PII,vector<PII>,greater<PII> > q; //实现小顶堆
q.push({s,0});
while(q.size()){
PII p = q.top(); q.pop();
int u = p.first;
if(d[u] < p.second)
continue;
for(int i = head[u]; ~i; i = e[i].next){
int v = e[i].to;
if(d[v] > d[u] + e[i].w){
d[v] = d[u] + e[i].w;
q.push({v,d[v]});
}
}
}
return d[t] == inf ? -1 : d[t];
}
int main()
{
int u, v, w, s, t;
while(cin>>n>>m){
init();
for(int i = 0; i < m; i++){
cin>>u>>v>>w;
addedge(u, v, w);
addedge(v, u, w);
}
cin>>s>>t;
cout<<dijkstra(s, t)<<endl;
}
return 0;
}
练习一:hdu2066一个人的旅行
题目大意:求从起点
s
s
s 到几个想去的点
t
1
,
t
2
,
.
.
.
,
t
m
t_1,t_2,...,t_m
t1,t2,...,tm 的最短路。
解题思路:题目说两个点之间有多条路,这没有关系的,像往常一样都加进去。题目中说的相邻,就是加一条边权为
0
0
0 的边就好了。
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int maxn = 1000 + 10;
const int maxm = 1000 + 10;
const int inf = 0x3f3f3f3f;
struct node{
int to, w, next;
}e[maxn*2];
int head[maxn], cnt;
int d[maxn];
int T,S,D;
void init(){
cnt = 0;
memset(e, 0, sizeof e);
memset(head, -1, sizeof head);
}
void addedge(int u, int v, int w){
e[cnt].to = v; e[cnt].w = w;
e[cnt].next = head[u]; head[u] = cnt++;
}
void dijkstra(int s){
memset(d, 0x3f, sizeof d);
d[s] = 0;
priority_queue<PII,vector<PII>, greater<PII> > q;
q.push({s,0});
while(q.size()){
PII p = q.top(); q.pop();
int u = p.first;
if(d[u] < p.second)
continue;
for(int i = head[u]; ~i; i = e[i].next){
int v = e[i].to;
if(d[v] > d[u] + e[i].w){
d[v] = d[u] + e[i].w;
q.push({v,d[v]});
}
}
}
}
int main()
{
int u, v, w;
while(cin>>T>>S>>D){
init();
for(int i = 1; i<=T; i++){
cin>>u>>v>>w;
addedge(u,v,w);
addedge(v,u,w);
}
for(int i = 1; i <= S;i++){
cin>>v;
addedge(0, v, 0);
addedge(v, 0, 0);
}
dijkstra(0);
int res = inf;
for(int i = 1; i <= D; i++){
cin>>v;
res = min(res, d[v]);
}
cout<<res<<endl;
}
return 0;
}