#include?
using?namespace?std;
#define?MAXV?50
#define?INF?32767
typedef?int?InfoType;
//鄰接矩陣存儲(chǔ)方法?
typedef?struct
{
????int?no;
????InfoType?info;
}?VertexType;
typedef?struct
{
????int?edges[MAXV][MAXV];
????int?ne;
????VertexType?vexs[MAXV];
}?MGraph;?
//狄克斯特拉算法
void?Ppath（int?path[]int?iint?v）
{
????int?k;
????k=path[i];
????if（k==v）?return;
????Ppath（pathkv）;
????cout<}???
int?biaoji1=0biaoji2=0;
void?Dispath（int?dist[]int?path[]int?s[]int?nint?v）
{
????int?i;
????for（i=0;i????{
????????if（i==v）?continue;
????????if（s[i]==1）
????????{
???cout<<“從“<????????????cout<????????????Ppath（pathiv）;
????????????cout<????????if（biaoji1!=5）
??{biaoji2+=dist[i];biaoji1++;