不知道为什么 第四种货币之后就不行了！
#include
#define MAX 2000
#define MIN 0
int n;
int Path[MAX][MAX];
float value[MAX][MAX];
typedef struct{
int vexs[MAX]; //顶点向量 可以存储每个顶点的信息
float arc[MAX][MAX];//邻接矩阵 主要存放关于边的信息
int vexnum,arcnum; //图中当前顶点数和弧数
}MGraph;
void CreateDG(MGraph G)
{
int i,j;
float A[10][10]={
{1.0,65.2,109.4,7.0,0.8,0.7,29.2,1.2,31.4,1.2},
{0.015,1.0,1.6,0.1,0.012,0.011,0.45,0.019,0.48,0.02},
{0.009,0.6,1.0,0.05,0.007,0.007,0.27,0.01,0.28,0.01},
{0.14,9.3,17.1,1.0,0.13,0.12,4.7,0.2,4.5,0.2},
{1.2,80.3,127.6,7.8,1.0,0.87,34.9,1.5,38.7,1.55},
{1.3,89.8,145.5,9.2,1.1,1.0,39.8,1.7,43.2,1.75},
{0.14,2.2,3.6,0.2,0.03,0.025,1.0,0.04,1.1,0.044},
{0.8,50.5,86.5,5.1,0.7,0.6,23.7,1.0,24.3,1.01},
{0.03,2.1,3.5,0.22,0.025,0.023,0.9,0.04,1.0,0.04},
{0.76,50.6,82.6,4.8,0.64,0.5,22.6,0.98,24.3,1.0}};
printf("1--------美元\n2--------印度卢比\n3--------日元\n ");
G->vexnum=10;
G->arcnum=G->vexnum (G->vexnum-1);
for(i=1;i<=G->vexnum;i++)
{
G->vexs[i]=i;
}
for(i=1;i<=G->vexnum;i++)
{
for(j=1;j<=G->vexnum;j++)
{
G->arc[i][j]=A[i-1][j-1];
}
}
}
void ShortestPath_FLOYD(MGraph G)
{
int i,j,k;
for(i=1;i<=G->vexnum;i++)
{
for(j=1;j<=G->vexnum;j++)
{
if(i==j)
value[i][j] = 1;
else
value[i][j]=G->arc[i][j];
if(G->arc[i][j]>MIN)
Path[i][j]=i;
else
Path[i][j]=0;
}
}
for(k=1;k<=G->vexnum;k++)
{for(i=1;i<=G->vexnum;i++)
{ for(j=1;j<=G->vexnum;j++)
{
if(value[i][k]*value[k][j]>value[i][j])
{
value[i][j]=value[i][k]*value[k][j];
Path[i][j]=Path[k][j];
}
}
}
}
}
void Procedure_print(int i,int j){
int a;
if(Path[i][j]==i)
{
printf("%d",i);
return;
}
else if(Path[i][j]==0)//输出结点i与结点j之间不存在通路
printf("NO path");
else
{
printf("%d ",Path[i][j]);
/ a++;
if(a == 1)
{
return ;
} */
Procedure_print(i,Path[i][j]);
}
}
int main()
{
int i,j;
MGraph G;
CreateDG(&G);
ShortestPath_FLOYD(&G);
for(int k=1;k<=10;k=k+1)
{
scanf("%d",&i);
if(value[i][i]>1)
{
printf("请输入开始币种\n");
printf("套汇所得为：");
printf("%f\n",value[i][i]);
printf("兑换顺序的逆序输出：\n%d ",i);
Procedure_print(i,i);
printf("\n");
}
else
{
printf("wrong\n");
}
}
}
