动态规划法(01图问题)多源点最短路径问题

1.代码
//有向带权图

**#include<iostream>
#include<stdio.h>
#include<windows.h>
using namespace std;


const int MAX = 100;
const int n = 3;                             //假设图中最多顶点个数
void Floyd(int arc[n][n], int dist[n][n]);//arc代价矩阵，有向边的权值  dist存放迭代过程中求得的最短路径长度

int main()
{
	int arc[n][n]={{0,4,11},{6,0,2},{3,MAX,0}};
	int dist[n][n];
	Floyd(arc,dist);
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
			cout<<dist[i][j]<<"  ";
		cout<<endl;
	}
	Sleep(800000);
	return 0;
}
void Floyd(int arc[n][n], int dist[n][n])
{
	int i, j, k;
	for (i = 0; i < n; i++)                     //初始化矩阵dist
		for (j = 0; j < n; j++)
			dist[i][j] = arc[i][j];
		for (k = 0; k < n; k++)                   //进行n次迭代
			for (i = 0; i < n; i++)       
				for (j = 0; j < n; j++)
					if (dist[i][k] + dist[k][j] < dist[i][j]) //基本语句
						dist[i][j] = dist[i][k] + dist[k][j];
}
**

2.结果示例