【數據結構】最小生成樹Prim算法

//建立圖的鄰接矩陣儲存結構 #include <stdio.h> #include <string.h> #define M 20 #define FINITY 5000 typedef struct { char vexs[M]; int edges[M][M]; int n,e; }Mgraph; typedef struct edgedata { int begin,en

>>阅读原文<<