From d3ad53e4f2157158276ec84b3704d4ce7858b25c Mon Sep 17 00:00:00 2001
From: Leehouc <152672308+Leehouc@users.noreply.github.com>
Date: Wed, 4 Sep 2024 17:51:11 +0800
Subject: [PATCH] =?UTF-8?q?Update=200053.=E5=AF=BB=E5=AE=9D-Kruskal.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/kamacoder/0053.寻宝-Kruskal.md | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

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