From 4427d3c511df65ae66f13cade2d43d8ac46a27c2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=B2=A9=E5=B2=A9?=
 <68364461+oxyanyano@users.noreply.github.com>
Date: Tue, 29 Mar 2022 11:39:07 +0800
Subject: [PATCH] =?UTF-8?q?Update=206.5=E6=9C=80=E5=B0=8F=E7=94=9F?=
 =?UTF-8?q?=E6=88=90=E6=A0=91(Prim=E7=AE=97=E6=B3=95=E3=80=81Kruskal?=
 =?UTF-8?q?=E7=AE=97=E6=B3=95).md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 6.5最小生成树(Prim算法、Kruskal算法).md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/6.5最小生成树(Prim算法、Kruskal算法).md b/6.5最小生成树(Prim算法、Kruskal算法).md
index a267841..f2f23c6 100644
--- a/6.5最小生成树(Prim算法、Kruskal算法).md
+++ b/6.5最小生成树(Prim算法、Kruskal算法).md
@@ -30,9 +30,9 @@
 每轮遍历**isJoin**数组，第一遍找到**lowCost**最低的顶点，然后加入；第二遍循环遍历更新各点的**lowCost**值。
 则`时间复杂度`=$$O(|V|^2)$$，适合`边稠密图`
 
-![1638175026761](F:\408数据结构\图片\1638175026761.png)
+![1638175026761](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1638175026761.png)
 
-![1638175026757](F:\408数据结构\图片\1638175026757.png)
+![1638175026757](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1638175026757.png)
 
 ### 三、Kruskal算法（克鲁斯卡尔算法）