动态规划(01图问题)多段图最短路径问题

1.代码

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


const int N = 20;
const int MAX = 1000;
int arc[N][N];               //存储弧上的权值
int Backpath(int n);
int creatGraph();

int main()
{
	int n = creatGraph( );
	int pathLen = Backpath(n);
	cout<<"最短路径的长度是："<<pathLen<<endl;
	Sleep(80000);
	return 0;
}

int creatGraph()
{
	int i, j, k;
	int weight;
	int vnum, arcnum;
	cout<<"请输入顶点的个数和边的个数：";
	cin>>vnum>>arcnum;
	for (i = 0; i < vnum; i++) //初始化为max
		for (j = 0; j < vnum; j++)
			arc[i][j] = MAX;
	for (k = 0; k < arcnum; k++) //输入图中的信息
	{
		cout<<"请输入边的两个顶点和权值：";
		cin>>i>>j>>weight;
		arc[i][j] = weight;
	}
	return vnum;
}


int Backpath(int n)
{
	int i, j, temp;
	int cost[N];//存储最短路径的长度
	int path[N];//记录状态转移，
	for(i = 0; i < n; i++)//初始化
	{
		cost[i] = MAX;
		path[i] = -1;
	}
	cost[0] = 0;//顶点0为源点
	for(j = 1; j < n; j++) //执行填表工作，
	{
		for(i = j - 1; i >= 0; i--)//考察所有入边
		{
			if (arc[i][j] + cost[i] < cost[j])
			{
				cost[j] = arc[i][j] + cost[i];
				path[j] = i;
			}
		}
	}
	cout<<n-1;         //输出终点
	i = n-1;
	while (path[i] >= 0)//依次输出path[i]
	{
		cout<<"<-"<<path[i];
		i = path[i];//求得路径上顶点i的前一个顶点
	}
	cout<<endl;
	return cost[n-1];//返回最短路径长度
}

2.结果示例