文章
7
粉丝
0
获赞
24
访问
624
#define _CRT_SECURE_NO_WARNINGS
#include <limits.h>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<ctype.h>
#define maxsize 200
typedef struct {//边结构体
int start ,end;
int weight;
}edge;
typedef struct {//图
int numvex,numedg;
edge Edge[maxsize] ;
}Graph;
int parent[maxsize];
int find(int v) {
while (parent[v]!=v) {
v = parent[v];
}
return v;
}
void merge(int root1,int root2) {
if (root1!=root2) {
parent[root2] = root1;
}
}
void sort(Graph *G) { //按照边的权值排序
for (int i = G->numedg-1;i>0;i--) {
int flag = 0;
for (int j = 0;j<i;j++) {
if (G->Edge[j].weight>G->Edge[j+1].weight) {
...
登录后发布评论
暂无评论,来抢沙发