E:最短路
总时间限制: 1000ms 内存限制: 65536kB
描述
有N(不大于10)座城市,编号为1至N,已知任意两个城市间距离(不超过1000的非负整数)。求从城市1至城市N的最短路。
输入
第一行输入N
之后N行,每行N个整数,描述了城市间距离的邻接矩阵,其中第i行第j个表示城市i到城市j的距离。相邻整数用空格分开
输出
第一行输出最短路径长度
第二行输出经过的城市编号,用空格隔开
代码:
#include<stdio.h>
#include<iostream>
using namespace std;
#define INFINITY 0x3f3f3f3f
#define VERTEX_MAX 20
struct Graph
{
int Distance[VERTEX_MAX][VERTEX_MAX];
int Vertex, Side;
};
Graph graph;
int LastPlace[VERTEX_MAX];
int ShortestDistance[VERTEX_MAX];
int flag[VERTEX_MAX];//标志,每次小循环找到距离最小值的那个点时,置为1;
int main()
{
int i,N,j;
int temp=0,temptemp;//temp为存储临时存放的最小值上家位置
int min = 0x3f3f3f3f3f;
cin >> N;
for (i = 0; i <= N - 1; i++)
{
for (j = 0; j <= N - 1; j++)
{
cin >> graph.Distance[i][j];
}
}
for (i = 1; i <= N; i++)
LastPlace[i-1] = 0;
for (i = 1; i <= N; i++)
flag[i - 1] = 0;
for (i = 0; i <= N - 1; i++)
{
ShortestDistance[i] = graph.Distance[0][i];
}
for (i = 1; i <= N-1; i++)
{
min = 0x3f3f3f3f3f;
for (j = 0; j <= N-1; j++)
{
if (graph.Distance[0][j] != 0 && flag[j] != 1)
{
if (ShortestDistance[j] > ShortestDistance[temp] + graph.Distance[temp][j])
{
LastPlace[j] = temp;
ShortestDistance[j] = ShortestDistance[temp] + graph.Distance[temp][j];
}//观察是否需要用上家的最短路径加上上家到本家的路径得到新的路,替换原来的路;
if (min > ShortestDistance[j])
{
min = ShortestDistance[j];
temptemp = j;
}
}
}
temp = temptemp;
flag[temptemp] = 1;
}
//for (i = 0; i <= 5; i++)
//{
// cout << LastPlace[i];
//}测试直接输出数
int shuchu[VERTEX_MAX]; int x, y;
while (1)
{
cout << "最终目的地:";
cin >> y;
if (y > N || y < 1)
{
cout << "出错啦"; break;
}
y = y - 1;//将地点值减一方便数组下标注从零开始思维
cout <<"最短距离:"<< ShortestDistance[y]<<endl;
shuchu[0] = y;
i = 1;
while (1)
{
shuchu[i] = LastPlace[y];
y = shuchu[i];
if (y == 0)break;
i++;
}
for (x = i; x >= 0; x--)
{
cout << shuchu[x]+1<<" ";//输出时记得加回去
}
for (x = 0; x <= i; x++)
{
shuchu[i] = 0;
}
cout << endl;
}
}
输出结果:
个人总结: