algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 15:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0053.寻宝-Kruskal.md

Browse Source
This commit is contained in:
Leehouc
2024-09-04 17:51:11 +08:00
committed by GitHub
parent fd0f78cac2
commit d3ad53e4f2
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/kamacoder/0053.寻宝-Kruskal.md
View File

@ -607,7 +607,7 @@ int main()
conne_gra[i] = i; conne_gra[i] = i;
} }
// 读取所有边的信息并存储到edg（存储所有边）数组中 // 读取所有边的信息并存储到edg（存储所有边的）数组中
for (int i = 0; i < e; ++i) for (int i = 0; i < e; ++i)
{ {
scanf("%d%d%d", &v1, &v2, &val); scanf("%d%d%d", &v1, &v2, &val);
@ -670,12 +670,13 @@ int main()
scanf("%d%d", &v, &e); scanf("%d%d", &v, &e);
struct Edge *edg = (struct Edge *)malloc(sizeof(struct Edge) * e); struct Edge *edg = (struct Edge *)malloc(sizeof(struct Edge) * e);
int *conne_gra = (int *)malloc(sizeof(int) * (v + 1)); int *conne_gra = (int *)malloc(sizeof(int) * (v + 1));
// 初始化连通图数组，每个顶点初始时只与自己相连通 // 初始化连通图数组，每个顶点初始时只与自己相连通
for (int i = 0; i <= v; ++i) for (int i = 0; i <= v; ++i)
{ {
conne_gra[i] = i; conne_gra[i] = i;
} }
// 读取所有边的信息并存储到edg（存储所有边）数组中 // 读取所有边的信息并存储到edg（存储所有边的）数组中
for (int i = 0; i < e; ++i) for (int i = 0; i < e; ++i)
{ {
scanf("%d%d%d", &v1, &v2, &val); scanf("%d%d%d", &v1, &v2, &val);
@ -683,6 +684,7 @@ int main()
edg[i].vex2 = v2; edg[i].vex2 = v2;
edg[i].val = val; edg[i].val = val;
} }
bubblesort(edg, e); // 调用冒泡排序函数对边进行排序 bubblesort(edg, e); // 调用冒泡排序函数对边进行排序
// Kruskal算法的实现，通过边数组构建最小生成树 // Kruskal算法的实现，通过边数组构建最小生成树