样例解析:
每组数据第一行包含两个正整数N和M,分别代表现有城镇的数目和已修建的道路的数目。城镇分别以0~N-1编号。
接下来是M行道路信息。每一行有三个整数A,B,X,表示城镇A和城镇B之间有一条长度为X的双向道路。
再接下一行有两个整数S,T,分别代表起点和终点。
1.Dijkstra算法
(迪杰斯特拉算法)
时间复杂度O(n2)
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int inf = 1<<30;
int n,m;
int map[300][300];
int vis[300],cast[300];
void Dijkstra(int s,int e)
{
int i,j,min,pos;
memset(vis,0,sizeof(vis));
cast[s] = 0;
vis[s] = 1;
for(i = 0; i<n; i++)
cast[i] = map[s][i];
for(i = 1; i<n; i++)
{
min = inf;
for(j = 0; j<n; j++)
{
if(cast[j]<min && !vis[j])
{
pos = j;
min = cast[j];
}
}
vis[pos] = 1;
for(j = 0; j<n; j++)
{
if(cast[pos]+map[pos][j]<cast[j] && !vis[j])
cast[j] = cast[pos]+map[pos][j];
}
}
}
int main()
{
int i,j,x,y,z,start,end;
while(~scanf("%d%d",&n,&m))
{
for(i = 0; i<200; i++)
{
for(j = 0; j<200; j++)
map[i][j] = inf;
map[i][i] = 0;
}
for(i = 0; i<m; i++)
{
scanf("%d%d%d",&x,&y,&z);
if(z<map[x][y])
map[x][y] = map[y][x] = z;
}
scanf("%d%d",&start,&end);
Dijkstra(start,end);
if(cast[end]==inf)
printf("%d\n",-1);
else
printf("%d\n",cast[end]);
}
return 0;
}
2.Fibonacci Heap优化
时间复杂度O(nlogn)
#include <stdio.h>
#include <queue>
#include <string.h>
#include <algorithm>
using namespace std;
const int inf = 1<<30;
const int L = 1000+10;
struct Edges
{
int x,y,w,next;
};
struct node
{
int d;
int u;
node (int dd = 0,int uu = 0):d(dd),u(uu) {}
bool operator < (const node &x) const
{
return u>x.u;
}
};
priority_queue<node> Q;
Edges e[L<<2];
int head[L];
int dis[L];
int vis[L];
void AddEdge(int x,int y,int w,int k)
{
e[k].x = x,e[k].y = y,e[k].w = w,e[k].next = head[x],head[x] = k++;
e[k].x = y,e[k].y = x,e[k].w = w,e[k].next = head[y],head[y] = k++;
}
void init(int n,int m)
{
int i;
memset(e,-1,sizeof(e));
for(i = 0; i<n; i++)
{
dis[i] = inf;
vis[i] = 0;
head[i] = -1;
}
for(i = 0; i<2*m; i+=2)
{
int x,y,w;
scanf("%d%d%d",&x,&y,&w);
AddEdge(x,y,w,i);
}
}
int Dijkstra(int n,int src)
{
node mv;
int i,j,k,pre;
vis[src] = 1;
dis[src] = 0;
Q.push(node(src,0));
for(pre = src,i = 1; i<n; i++)
{
for(j = head[pre]; j!=-1; j=e[j].next)
{
k = e[j].y;
if(!vis[k] && dis[pre]+e[j].w<dis[k])
{
dis[k] = dis[pre]+e[j].w;
Q.push(node(e[j].y,dis[k]));
}
}
while(!Q.empty()&&vis[Q.top().d]==1)
Q.pop();
if(Q.empty())
break;
mv = Q.top();
Q.pop();
vis[pre=mv.d] = 1;
}
}
int main()
{
int n,m,i,j,x,y;
while(~scanf("%d%d",&n,&m))
{
init(n,m);
scanf("%d%d",&x,&y);
Dijkstra(n,x);
printf("%d\n",dis[y]==inf?-1:dis[y]);
}
return 0;
}
3.Floyd算法
时间复杂度O(n3)
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int inf = 100000000;
int map[205][205];
void Floyd(int n)
{
int i,j,k;
for(i = 0;i<n;i++)
for(j = 0;j<n;j++)
for(k = 0;k<n;k++)
if(map[j][i]+map[i][k]<map[j][k])
map[j][k] = map[j][i]+map[i][k];
}
int main()
{
int n,m,i,j,x,y,z,start,end;
while(~scanf("%d%d",&n,&m))
{
for(i = 0; i<200; i++)
{
for(j = 0; j<200; j++)
map[i][j] = inf;
map[i][i] = 0;
}
while(m--)
{
scanf("%d%d%d",&x,&y,&z);
if(z<map[x][y])
map[x][y] = map[y][x] = z;
}
Floyd(n);
scanf("%d%d",&start,&end);
printf("%d\n",map[start][end]!=inf?map[start][end]:-1);
}
return 0;
}
4.Spfa算法
Bellman-Ford(贝尔曼夫得算法)
(1)堆栈实现
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int inf = 1<<30;
const int L = 2000+10;
struct Edges
{
int x,y,w,next;
}e[L<<2];
int head[L];
int dis[L];
int vis[L];
int relax(int u,int v,int c)
{
if(dis[v]>dis[u]+c)
{
dis[v] = dis[u]+c;
return 1;
}
return 0;
}
void AddEdge(int x,int y,int w,int k)
{
e[k].x = x,e[k].y = y,e[k].w = w,e[k].next = head[x],head[x] = k++;
e[k].x = y,e[k].y = x,e[k].w = w,e[k].next = head[y],head[y] = k++;
}
void init(int n,int m)
{
int i;
memset(e,-1,sizeof(e));
for(i = 0; i<n; i++)
{
dis[i] = inf;
vis[i] = 0;
head[i] = -1;
}
for(i = 0; i<2*m; i+=2)
{
int x,y,w;
scanf("%d%d%d",&x,&y,&w);
AddEdge(x,y,w,i);
}
}
int SPFA(int src)
{
int i;
dis[src] = 0;
vis[src] = 1;
int Q[2005],top = 1;
Q[0] = src;
while(top)
{
int u,v;
u = Q[--top];
vis[u] = 0;
for(i = head[u];i!=-1;i=e[i].next)
{
v = e[i].y;
if(relax(u,v,e[i].w)==1 && !vis[v])
{
Q[top++] = v;
vis[v] = 1;
}
}
}
}
int main()
{
int n,m,i,j,x,y;
while(~scanf("%d%d",&n,&m))
{
init(n,m);
scanf("%d%d",&x,&y);
SPFA(x);
printf("%d\n",dis[y]==inf?-1:dis[y]);
}
return 0;
}
(2)队列实现
#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
const int inf = 1<<30;
const int L = 2000+10;
struct Edges
{
int x,y,w,next;
}e[L<<2];
int head[L];
int dis[L];
int vis[L];
int cnt[L];
int relax(int u,int v,int c)
{
if(dis[v]>dis[u]+c)
{
dis[v] = dis[u]+c;
return 1;
}
return 0;
}
void AddEdge(int x,int y,int w,int k)
{
e[k].x = x,e[k].y = y,e[k].w = w,e[k].next = head[x],head[x] = k++;
e[k].x = y,e[k].y = x,e[k].w = w,e[k].next = head[y],head[y] = k++;
}
void init(int n,int m)
{
int i;
memset(e,-1,sizeof(e));
for(i = 0; i<n; i++)
{
dis[i] = inf;
vis[i] = 0;
head[i] = -1;
}
for(i = 0; i<2*m; i+=2)
{
int x,y,w;
scanf("%d%d%d",&x,&y,&w);
AddEdge(x,y,w,i);
}
}
int SPFA(int src)
{
int i;
memset(cnt,0,sizeof(cnt));
dis[src] = 0;
queue<int> Q;
Q.push(src);
vis[src] = 1;
cnt[src]++;
while(!Q.empty())
{
int u,v;
u = Q.front();
Q.pop();
vis[u] = 0;
for(i = head[u];i!=-1;i=e[i].next)
{
v = e[i].y;
if(relax(u,v,e[i].w)==1 && !vis[v])
{
Q.push(v);
vis[v] = 1;
}
}
}
}
int main()
{
int n,m,i,j,x,y;
while(~scanf("%d%d",&n,&m))
{
init(n,m);
scanf("%d%d",&x,&y);
SPFA(x);
printf("%d\n",dis[y]==inf?-1:dis[y]);
}
return 0;
}