我在调用FLOYD函数的时候，遇到问题：如何打印所求最路径值？
void  floyd_short(Mgraph g,int u,int y)
{   int length[MAXVEX][MAXVEX]; //最短路径长度矩阵length                            
int i,j,s,k,t,next; 
int path[maxvex][maxvex];                                      
t=g.n;           //总顶点数                       
for(i=0;i<=t;i++)
for(j=0;j<=t;j++)
length[i][j]=g.arcs[i][j];                                   
if(u==y)
printf("the shortest road of the start-node and end-node is 0!");
if(u!=y)                    
for(i=0;i<=t;i++)
for(j=0;j<=t;j++)
{ path[i][j]=0; }
for(k=0;k<=t;k++)      //floyd算法求length矩阵  
for(i=0;i<=t;i++)
for(j=0;j<=t;j++)
           if(length[u][k]+length[k][y]<length[u][y])
{ length[u][y]=length[u][k]+length[k][y];
path[i][j]=k;}
next=path[i][j];
do{
next=path[next][j];
}while(next!=j);
if (length[i][j]==MAXINT)
printf(“无路径\n”);
//s=length[u][y];      //最短路径值                          
printf("the shortest road of the start-node and end-node is:%d\n",leng[u][y]);
}
那位朋友可以帮忙，谢谢你们了