Floyd算法:介绍如图:
打印路径,递归解决;
参考代码:
#include <cstdio>
#include <string>
#include <stack>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAX 1010
#define INF 65535
using namespace std;
int D[MAX][MAX];//记录起点到当前点的最短路径长度
int path[MAX][MAX];//记录当前点的路径路线
typedef struct ENode
{
int V1, V2;
int Weight;
}*Edge;
typedef struct GNode
{
int Vertex_num;
int EdgeNum;
int G[MAX][MAX];
int Data[MAX];
}*Graph;
/* 邻接矩阵存储 - 多源最短路算法 */
bool Floyd(Graph G)
{
//初始化为权重
for(int i = 0; i < G->Vertex_num; i++)
{
for(int j = 0; j < G->Vertex_num; j++)
{
D[i][j] = G->G[i][j];
}
}
for(int k = 0; k < G->Vertex_num; k++)
{
for(int i = 0; i < G->Vertex_num; i++)
{
for(int j = 0; j < G->Vertex_num; j++)
{
if(D[i][k] + D[k][j] < D[i][j]) D[i][j] = D[i][k] + D[k][j];
//自己到自己已经负边直接返回
if(i == j && D[i][j] < 0) return false;
//记录路径
path[i][j] = k;
}
}
}
return true;
}
//递归打印
void print(int i,int j)
{
k = path[i][j];
if(k == -1) return;
print(i,k);
cout << k <<" ";
print(k,j);
}
int main()
{
return 0;
}