1、基本原理。
2、实现。
//假定图中最大顶点个数为5
#define MAX_VERTEX 5
//采用二维数组来表示图
//两个顶点间的距离为1000 ,代表两顶点间无之间相连的边
int graph[MAX_VERTEX][MAX_VERTEX]=
{
{0,1,2,1000,4},
{1,0,1000,8,2},
{2,1000,0,1000,6},
{1000,8,1000,0,3},
{4,2,6,3,0}
};
void floydAlgorithm(int graph[MAX_VERTEX][MAX_VERTEX])
{
int minDistance[MAX_VERTEX][MAX_VERTEX];
int path[MAX_VERTEX][MAX_VERTEX];
for(int i=0;i<MAX_VERTEX;++i)
{
for(int j=0;j<MAX_VERTEX;++j)
{
minDistance[i][j]=graph[i][j];
path[i][j]=-1;
}
}
for(int k=0;k<MAX_VERTEX;++k)
{
for(int i=0;i<MAX_VERTEX;++i)
{
for(int j=0;j<MAX_VERTEX;++j)
{
if(minDistance[i][j]>minDistance[i][k]+minDistance[k][j])
{
minDistance[i][j]=minDistance[i][k]+minDistance[k][j];
path[i][j]=k;
}
}
}
}
std::cout<<"Matrix minDistance\n";
for(int i=0;i<MAX_VERTEX;++i)
{
for(int j=0;j<MAX_VERTEX;++j)
{
std::cout<<minDistance[i][j]<<"\t";
}
std::cout<<std::endl;
}
std::cout<<"Matrix path\n";
for(int i=0;i<MAX_VERTEX;++i)
{
for(int j=0;j<MAX_VERTEX;++j)
{
std::cout<<path[i][j]<<"\t";
}
std::cout<<std::endl;
}
}
//测试函数int main(){ floydAlgorithm(graph); return 0;}
3、运行截图。