本蒟蒻的第一篇文章,主要留给考前复习用(也许会看吧)
本文仅介绍最常用(我能看懂)的三种算法,如果学到其他算法,我可能会在之后的文章中详细介绍。
——————————————————————————————————————————————————————————————————
1.经典的Dijkstra算法
迪杰斯特拉算法因其远近闻名的松弛长边操作而闻名,用每一行结点不断去松弛dist,最终就得到该点到各点的最短距离
异常简洁的代码如下:
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#define maxm 500010
#define maxn 10010
using namespace std;
int n, m, S;
struct Edge
{
int to, nxt, w;
}edge[maxm];
int h[maxn], cnt;
void add_edge(int u, int v, int w)
{
++ cnt;
edge[cnt].to = v;
edge[cnt].w = w;
edge[cnt].nxt = h[u];
h[u] = cnt;
}
int dis[maxn];
bool vis[maxn];
const int inf=0x7fffffff;
typedef pair<int, int> pii;
priority_queue<pii,vector<pii>,greater<pii> > Q;
void Dijkstra(int S)
{
for(int i = 1; i <= n; ++ i) dis[i] = inf;
dis[S] = 0;
Q.push(make_pair(dis[S], S));
while(!Q.empty())
{
int u = Q.top().second; Q.pop();
if(vis[u]) continue;
vis[u] = true;
for(int i = h[u]; i; i = edge[i].nxt)
{
int v = edge[i].to;//printf("%d %d\n", u, v);
if(!vis[v] && dis[v] > dis[u] + edge[i].w)
{
dis[v] = dis[u] + edge[i].w;
Q.push(make_pair(dis[v], v));
}
}
}
}
int main()
{
scanf("%d%d%d", &n, &m, &S);
int u, v, w;
for(int i = 1; i <= m; ++ i)
{
scanf("%d%d%d", &u, &v, &w);
add_edge(u, v, w);
}
Dijkstra(S);
for(int i = 1; i <= n; ++ i)
printf("%d ", dis[i]);
return 0;
}
——————————————————————————————————————————————————————————————————
2.经典的Floyd算法
特点:代码简单易懂,运用动态规划,时间复杂度O(n^3)。。
上代码:
void Floyd();
{
for ( int i = 0; i < n; ++i )
{
for ( int j = 0; j < n; ++j )
{
for ( int k = 0; k < n; ++k )
{
if ( Dis[i][k] + Dis[k][j] < Dis[i][j] )
{
Dis[i][j] = Dis[i][k] + Dis[k][j];
}
}
}
}
}
(调用的过程差不多长这样)
——————————————————————————————————————————————————————————————————
3.经典的SPFA算法
据说是Bellman Ford的优化,利用队列在时间复杂度较低的情况下求出最短路径
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#define maxm 500010
#define maxn 100010
using namespace std;
int n,m,S;
struct Edge
{
int nxt,to,w;
}edge[maxm];
int h[maxn],cnt;
void add_edge(int u,int v,int w)
{
++cnt;
edge[cnt].to=v;
edge[cnt].w=w;
edge[cnt].nxt=h[u];
h[u]=cnt;
}
const int inf=0x7fffffff;
int dis[maxn];
bool vis[maxn];
queue<int> Q;
void SPFA(int S)
{
for(int i = 0; i <= n; ++ i) dis[i] = inf;
dis[S] = 0;
vis[S] = 1;
Q.push(S);
while(!Q.empty())
{
int u = Q.front();
Q.pop();
vis[u] = false;
for(int i = h[u]; i; i = edge[i].nxt)
{
int v = edge[i].to;
if(dis[v] > dis[u] + edge[i].w)
{
dis[v] = dis[u] + edge[i].w;
if(!vis[v]){vis[v]=true;Q.push(v); }
}
}
}
}
int main()
{
scanf("%d%d%d",&n,&m,&S);
int u,v,w;
for (int i=1;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&w);
add_edge(u,v,w);
}
Spfa(S);
for (int i=1;i<=n;i++)
printf("%d ",dis[i]);
return 0;
}