Floyd算法
那么如何求所有顶点之间的最短路径呢?
方法一:每次以一个顶点为源点,重复执行Dijkstra算法(时间复杂度O(n2))n次,时间复杂度O(n3)
方法二:弗洛伊德算法(Floyd)
算法思想:
- 逐个顶点试探
- 从vi到vj的所有可能存在的路径中,选出一条长度最短的路径
#include <iostream>
#include<cmath>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 100
//定义无穷大
#define MAXInt 32767
typedef int Status;
typedef char TElemType;
using namespace std;
//定义顶点数据类型
typedef char VerTexType;
//定义边的数据类型
typedef int ArcType;
//定义图的数据结构
typedef struct {
//顶点表
VerTexType vexs[MAXSIZE];
//邻接矩阵
ArcType arcs[MAXSIZE][MAXSIZE];
//当前结点数和当期边数
int vexnum, arcnum;
}AMGraph; //Adjacency(邻接) Matrix Graph
//函数输入一个顶点的值,返回该顶点在顶点表中的下标,不存在则返回-1
int LocateVex(VerTexType x, AMGraph& G) {
for (int i = 0; i < G.vexnum; i++)
{
if (x == G.vexs[i])
{
return i;
}
}
return -1;
}
void createUDN(AMGraph& G) {
//先输入的顶点数和边数
cout << "请输入要创建的有向网的顶点数和边数:" << "\n";
scanf_s("%d%d", &G.vexnum, &G.arcnum);
//依次输入各个顶点的值
cout << "依次输入各个顶点的值" << "\n";
for (int i = 0; i < G.vexnum; i++) {
cin >> G.vexs[i];
}
//对邻接矩阵进行初始化
for (int i = 0; i < G.vexnum; i++) {
for (int j = 0; j < G.vexnum; j++) {
G.arcs[i][j] = MAXInt;
}
}
cout << "请输入每条边的顶点和权值:输入方式:顶点1 顶点2 权值" << "\n";
//输入依次输入每一条边的顶点和权值
for (int i = 0; i < G.arcnum; i++)
{
VerTexType a, b;
ArcType weight;
cin >> a >> b >> weight;
//找到输入的顶点a,b在顶点表中的下标
int x = LocateVex(a, G);
int y = LocateVex(b, G);
if (x != -1 && y != -1) {
G.arcs[x][y] = weight;
//G.arcs[y][x] = weight;
}
}
}
//输出顶点表以及邻接矩阵
void outPut(AMGraph G) {
cout << "顶点表如下:" << "\n";
for (int i = 0; i < G.vexnum; i++) {
printf("%c ", G.vexs[i]);
}
printf("\n输出邻接矩阵如下\n");
for (int i = 0; i < G.vexnum; i++)
{
for (int j = 0; j < G.vexnum; j++)
{
printf("%6d", G.arcs[i][j]);
}
printf("\n");
}
}
void Floyd(ArcType minPath[MAXSIZE][MAXSIZE],int length) {
//这一层循环代表依次加入各个顶点
for (int i = 0; i < length; i++) {
for (int j = 0; j < length; j++)
{
if (j!=i&&(minPath[j][i]!=0)&&(minPath[j][i]!=MAXInt))
{
for (int k = 0; k < length; k++)
{
if (k!=j&&(minPath[i][k]!=0)&&(minPath[i][k]!=MAXInt))
{
int newPath = minPath[j][i] + minPath[i][k];
if (newPath<minPath[j][k])
{
minPath[j][k] = newPath;
}
}
}
}
}
}
}
int main() {
AMGraph G;
createUDN(G);
outPut(G);
ArcType minPath[MAXSIZE][MAXSIZE];
for (int i = 0; i < G.vexnum; i++)
{
for (int j = 0; j < G.vexnum; j++)
{
if (i==j)
{
minPath[i][j] = 0;
}
else {
minPath[i][j] = G.arcs[i][j];
}
}
}
Floyd(minPath, G.vexnum);
cout << "\n有向图各个顶点之间的最短距离如下:" << "\n";
for (int i = 0; i < G.vexnum; i++)
{
for (int j = 0; j < G.vexnum; j++)
{
printf("%4d ", minPath[i][j]);
}
printf("\n");
}
return 0;
}
测试样例:
这里的结果是否正确可以自己手动推算,其实也可以使用正确的迪杰斯特拉算法进行验证。(注意要正确的迪杰斯特拉算法!)