5 0 5 4 10 -1 -1 0 -1 3 2 -1 -1 0 2 3 -1 -1 2 0 -1 -1 -1 1 5 0
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int INF = 32767; //设置无限大,这就说明,程序的数据要刻意小于这个值
const int MAXN = 10; //同理
int edge[MAXN][MAXN]; //地图;
int path[MAXN][MAXN]; //最短路径的路径保存,path[i][j]表示从i到j的前一个节点编号,比如1->0->3,path[1][3]=0;
int dist[MAXN][MAXN]; //表示从i到j的最短路径长度
//从设置的数组量就可以看出相比与dijkstra算法,floyd要简单一点
int Vex_num;
void print() //打印地图
{
cout << "顶点关系如下:\n";
cout << " ";
for (int i = 0; i < Vex_num; i++)
{
printf("%3d ", i);
}
cout << "\n";
for (int i = 0; i < Vex_num; i++)
{
cout << i;
for (int j = 0; j < Vex_num; j++)
{
printf("% 5d ", edge[i][j]);
}
cout << endl;
}
cout << "\n\n";
}
void find_path() //查找路径
{
//要知道怎么找到路径,首先要知道是如何存储路径的,比如path[i][j],代表的就是从i到j路径上,j的前一个顶点。写个例子:
//i->k->p->d->j是完整路径。那么path[i][j]=d, path[i][d]=p,path[i][p]=k,path[i][k]=i,则什么时候结束寻找?那就是,当path[i][x(某个顶点)]=i的时候
//结束,那么这就非常清楚了
for(int i=0;i<Vex_num;i++)
for (int j = 0; j < Vex_num; j++)
{
int pre; //表示path[i][j]
//一对一对去找;
cout << "顶点 " << i << "到顶点 " << j << " 的路径长度为:"<<dist[i][j]<<" 路径为:";
pre = path[i][j];
if (pre != -1)
{
cout << j << "->" << pre;
}
else
cout << j;
while (pre!=-1)
{
pre = path[i][pre];
if (pre != -1)
cout << "->" << pre;
}
cout << endl;
}
}
void floyd()
{
for(int k=0;k<Vex_num;k++) //穷举插入点
for(int i=0;i<Vex_num;i++) //穷举所有点对
for (int j = 0; j < Vex_num; j++)
{
if (dist[i][j] >dist[i][k] + dist[k][j]) //观察插入点后,两个点之间的距离是否变短,如果变短,则替换,且更新最短路径
{
dist[i][j] = dist[i][k] + dist[k][j];
path[i][j] = path[k][j];
}
}
find_path();
}
int main()
{
cout << "输入要操作的点数:";
cin >> Vex_num;
//先初始化地图
for (int i = 0; i < Vex_num; i++)
for (int j = 0; j < Vex_num; j++)
edge[i][j] = INF;
memset(dist, -1, sizeof(dist));
for (int i=0;i<Vex_num;i++)
{
int i_to_j; //点i到点j的距离
for (int j = 0; j < Vex_num; j++)
{
cout << "输入顶点 " << i << "到顶点 " << j << "的距离:";
cin >> i_to_j;
cout << endl;
if (i_to_j != -1) //输入-1表示无穷大
edge[i][j] = i_to_j;
dist[i][j] = edge[i][j];
if (dist[i][j] != INF && i != j) //如果i,j之间有弧,path[i][j]的前驱是i,
path[i][j] = i;
else //否则,没有前驱
path[i][j] = -1;
}
}
print();
floyd();
}