摘要： C语言最短路径问题#include "datastru.h"#include stdio.h#include malloc.h#define MAX 10000MGRAPH create_mgraph(){int i, j, k, h;MGRAPH mg;mg.kind = 3;printf("\n\n输入顶点数和边数(用逗号隔开) : ");scanf("%d,%d", &i,&j);mg.vexnum = i;mg.arcnum = j;fflush(stdin);for(i = 0; i mg.vexnum; i++){ printf("输入顶点 %d 的值 : ",i + 阅读全文