N表示节点的个数 , M表示边的个数
1.Floyed
dp 思想 ,多源最短路 , 复杂度O( n 3 n^3 n3)
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dis[i][j] = min(dis[i][j] , dis[i][k] + dis[k][j]);
}
}
}
2. spfa
能处理负边的单源最短路 , 复杂度O(
k
M
kM
kM) , 最坏复杂度O(
N
M
NM
NM)
spfa 的 SLF + swap 优化
int s,n,m,p;
int head[N],total;
struct node{
int next,w,to;
void add(int u,int v,int w1)
{
next=head[u];
head[u]=total;
to=v;
w=w1;
}
}e[N];
deque<int> dq;
int dis[N];
bool vis[N];
void push(int x)
{
if(!dq.empty())
{
if(dis[x]<dis[dq.front()])
dq.push_front(x);
else dq.push_back(x);
if(dis[dq.front()]>dis[dq.back()])
swap(dq.front(),dq.back());
}
else dq.push_back(x);
}
void pop()
{
dq.pop_front();
if(!dq.empty() && dis[dq.front()]>dis[dq.back()])
swap(dq.front(),dq.back());
}
void spfa()
{
for(int i=1; i<=n; i++)
dis[i]=inf;
dis[s]=0;
vis[s]=1;
push(s);
while(!dq.empty())
{
int u=dq.front();
vis[u]=0;
pop();
for(int i=head[u]; i; i=e[i].next)
{
int v=e[i].to,w=e[i].w;
if(dis[v]>dis[u]+w)
{
dis[v]=dis[u]+w;
if(!vis[v])
push(v),vis[v]=1;
}
}
}
}
signed main()
{
scanf("%d%d%d%d",&n,&m,&p,&s);
for(int i=1; i<=m; i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
e[++total].add(u,v,w);
e[++total].add(v,u,w);
}
for(int i=1; i<=p; i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
e[++total].add(u,v,w);
}
spfa();
for(int i=1; i<=n; i++){
if(dis[i] == inf){
cout << "NO PATH\n";
}else{
cout << dis[i] << "\n" ;
}
}
return 0;
}
3,dijkstra
不带负边的单源最短路,复杂度O((N+M)logN)
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
typedef long long ull;
typedef unsigned long long ll;
const int N = 2e6+10;
const int NN = 1e6+100;
const int p = 1e5 + 3;
typedef pair<int,int>PII;
const int inf = 1e9 + 10;
int n,m;
int head[N] , to[N] , nex[N] , val[N] ,vis[N] ,cnt;
priority_queue<PII,vector<PII>,greater<PII>> q;
int dis[N] , cnts[N];
void add(int u,int v,int w){
to[++cnt] = v;
val[cnt] = w;
nex[cnt] = head[u];
head[u] = cnt ;
}
inline int read() {
bool sym = 0; int res = 0; char ch = getchar();
while (!isdigit(ch)) sym |= (ch == '-'), ch = getchar();
while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
return sym ? -res : res;
}
int main(){
n = read();
m = read();
for(int i=1;i<=n;i++) dis[i] = inf;
cnts[1] = 1;
dis[1] = 0;
for(int i=1;i<=m;i++){
int u,v;
u = read();
v = read();
add(u,v,1);
add(v,u,1);
}
q.push({0,1});
while(!q.empty()){
int k = q.top().se;
q.pop();
if(vis[k]) continue;
else vis[k] = 1;
for(int i=head[k] ; i ; i=nex[i]){
if(dis[k] + val[i] < dis[to[i]]){
dis[to[i]] = dis[k] + val[i];
q.push({dis[to[i]] , to[i]});
}
}
}
for(int i=1;i<=n;i++){
if(dis[i] == inf){
cout << "0\n" ;
}else{
cout << cnts[i] << "\n" ;
}
}
return 0;
}
一定注意 dij 的 vis 标记是标记一个节点是否访问过 , 而 spfa 的标记是标记一个节点是否在队列中,性质不同