m0_56030991的博客

原创 Prim算法、Kruskal算法构造最小生成树 && Dijkstra算法、Floyd算法求解最短路径（C++完整代码）

#include <iostream> #define MaxSize 100 #define INFINITY 9999 using namespace std; typedef struct { char vertex[MaxSize]; int edge[MaxSize][MaxSize]; int vexnum,arcnum; } AMGraph; struct { char adjvex; int lowcost; } closeedge[MaxSize]; int loc.