数据结构Kruskal算法求解最小生成树.docVIP

数据结构Kruskal算法求解最小生成树 #includestdio.h #includestdlib.h #includemalloc.h #define MAX 100 struct Node{ int vertex1; int vertex2; int weight; struct Node *next; }; typedef struct Node * Edge; Edge head = NULL; int visited[MAX]; Edge read(){ int v1, v2, w; Edge newNode = NULL, pointer = NULL; while(1){ scanf(%d %d %d, v1, v2, w); if(v1 == -1 || v2 == -1 || w == -1) break; newNode = (Edge)malloc(sizeof(struct Node)); newNode-vertex1 = v1; newNode-vertex2 = v2; newNode-weight = w; newNode-next = NULL; pointer = head; if(pointer == NULL) hea