最短路径问题目前只学了dijkstra算法,据我所知还有三种算法,Bellman-Ford(拼错了别怪我),Floyd,spfa,可能是这两天会学一下吧。
对于Dijkstra算法嘛,主要是贪心和dp思想的体现吧,有一个所谓的松弛操作,其实我感觉就是状态转移。它的实现方法我现在只会n方的时间复杂度,优先队列优化的还不会啊。具体来说就是遍历除了起点之外的所有点,选定当前距离起点最近的点作为跳板(跳板只使用一次),然后用这个跳板利用状态转移方程更新所有点到起点的距离,再次重新选取跳板,重复以上步骤,直到跳板没有与之联通的边了(不能走回头路)或者当前跳板就是终点就退出。其实加不加这个判断应该对时间复杂度影响不大,考虑最坏情况就是直到最后一次循环跳板才是终点,那么时间复杂度就是n方。
最短路径题单http://t.csdn.cn/xcGK4
hdu 2544 最短路 Problem - 2544
// Problem: 最短路
// Contest: HDOJ
// URL: http://acm.hdu.edu.cn/showproblem.php?pid=2544
// Memory Limit: 32 MB
// Time Limit: 5000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define int2 int
long long f[105][105];
long long dis[105];
long long vis[105];
int n, m;
void dijkstra(int s, int e)
{
for (int i = 1; i <= n; i++)
{
vis[i] = 0;
dis[i] = f[s][i];
}
for (int i = 1; i <= n - 1; i++)
{
int minn = inf;
int best;
for (int i = 1; i <= n; i++)
{
if (dis[i] < minn && vis[i] == 0)
{
minn = dis[i];
best = i;
}
}
vis[best] = 1;
for (int i = 1; i <= n; i++)
{
dis[i] = min(dis[i], dis[best] + f[best][i]);
}
}
printf("%d\n", dis[e]);
}
int main()
{
while (cin >> n >> m, n + m)
{
for (int i = 1; i <= n; i++)
{
dis[i] = inf;
vis[i] = 0;
for (int j = 1; j <= n; j++)
{
f[i][j] = inf;
}
}
for (int i = 1; i <= m; i++)
{
long long a, b, c;
cin >> a >> b >> c;
f[a][b] = min(f[a][b], c);
f[b][a] = f[a][b];
}
dijkstra(1, n);
}
}
hdu 1874 畅通工程续 Problem - 1874
#include <bits/stdc++.h>
using namespace std;
int vis[205];
int dis[205];
int f[205][205];
#define inf 0x3f3f3f3f
int main()
{
int n, m;
while (cin >> n >> m)
{
for (int i = 0; i < n; i++)
{
vis[i] = 0;
dis[i] = inf;
for (int j = 0; j < n; j++)
f[i][j] = inf;
}
for (int i = 1; i <= m; i++)
{
int a, b, x;
cin >> a >> b >> x;
f[a][b] = min(f[a][b], x);
f[b][a] = f[a][b];
}
int s, t;
cin >> s >> t;
int best = s;
dis[s] = 0;
vis[best] = 1;
for (int j = 0; j < n; j++)
{
int temp = inf;
for (int i = 0; i < n; i++)
{
if (i != s)
if (f[best][i] != inf)
{
dis[i] = min(dis[i], dis[best] + f[best][i]);
temp = min(temp, dis[i]);
}
}
if (temp == inf)
break;
int minn = inf;
for (int i = 0; i < n; i++)
{
if (dis[i] < minn && vis[i] == 0)
{
best = i;
minn = dis[i];
}
}
vis[best] = 1;
}
if (dis[t] == inf)
printf("-1\n");
else
printf("%d\n", dis[t]);
}
}