数据结构：图-最短路径-Dijkstra算法

#define MAXSIZE 100
#define MAXLEN 10
#include<stdio.h>
#include<stdlib.h>
#define MAXCOST 1000
#define MAX 100
typedef struct vertex
{
    int num;
}DataType;

typedef struct
{
    DataType vexs[MAXLEN+1];
    int edges[MAXLEN+1][MAXLEN+1];
    int n,e;
}MGraph;

void createcost( MGraph *g,int n,int e )
{
   int i,j,k,v1,v2;
   int weight;
   g->n=n;
   g->e=e;
   for(i=1;i<=g->n;i++)
    {
       g->vexs[i].num=i;
    }
   for(i=1;i<=g->n;i++)
      for(j=1;j<=g->n;j++)
    {
      g->edges[i][j]=MAXCOST;
    }
   for(k=1;k<=g->e;k++)
    {
   scanf("%d,%d,%d",&v1,&v2,&weight);
   g->edges[v1][v2]=weight;
    }
}
void Dijkstra(MGraph g,int v)
{ 
    int dist[MAXLEN+1];
	int path[MAXLEN+1];
    int s[MAXLEN+1];
    int min,i,j,w,k;
    for(i=1;i<=g.n;i++)
    { 
	  dist[i]=g.edges[v][i];
      if(i==v) s[i]=1; 
	  else     s[i]=0;
      path[i]=-1;
      if(dist[i]<MAXCOST)
       	path[i]=v;
	}
   for(k=1;k<g.n;k++) 
   { 
      min=MAXCOST;
	  w=0; 
	  for(j=1;j<=g.n;j++)
        if(s[j]==0&&dist[j]<min) 
        { 
	      w=j;
	      min=dist[j]; 
	    }
      s[w]=1;
    for(i=1;i<=g.n;i++) 
    if (s[i]==0&&w!=0&&(min+g.edges[w][i])<dist[i])
    { 
	    dist[i]=min+g.edges[w][i]; 
		path[i]=w; 
	}
    }
    for(i=1;i<=g.n;i++)
     { 
	   if(i!=v)
       if(dist[i]==MAXCOST) 
	    printf("%d--->%d无最短路径！\n",v,i);
       else
        { 
	       printf("%d--->%d: length=%d\n",v,i,dist[i]); 
           printf("path: ");
           j=i;
           while(path[j]!=v) 
            { 
		    printf("%d-",path[j]);
            j=path[j];
            }
            printf("%d\n",path[j]);
        }
    } 
}

int main()
{
    MGraph x;
    int peak;
    int side;
    printf("请输入顶点数和边数:");
    scanf("%d%d",&peak,&side);
    printf("请输入邻接矩阵:(测试数据)\n");
    createcost(&x,peak,side);
    Dijkstra(x,1);
    return 0;
}

测试数据：
1,2,40
1,3,10
1,5,45
2,5,10
2,3,15
3,1,20
3,4,15
4,2,20
4,5,35
6,4,3