从某个源点到其于各顶点的最短路径

#include "stdio.h"
#include "stdlib.h"
#define  maxvex 10
#define  intmax  32767
typedef struct  
{
char vexs[maxvex];
int  edges[maxvex][maxvex];
    int  vexnum;
int  edgenum;
}graph;

graph g;

main()
{
char b,e;
int i,j,w,K;
void shortpath(int v0);
printf("\n请输入所要遍历图的顶点个数与边数：");
scanf("%d%d",&g.vexnum,&g.edgenum);
for(i=1;i<=g.vexnum;i++)
{
getchar();
    printf("\t第%d个顶点的信息:",i);
    scanf("%c",&g.vexs[i]);
}

for(i=1;i<=g.vexnum;i++)
   for(j=1;j<=g.vexnum;j++)