From 45ad945e63e90b45ef063d6c7dcc3cbc7ad60b2f Mon Sep 17 00:00:00 2001
From: SusanAIFF <susan_aiff@163.com>
Date: Tue, 2 Jul 2024 18:02:39 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E4=BA=86prim=E5=AF=BB?=
 =?UTF-8?q?=E5=AE=9D=E7=9A=84python=E5=86=99=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

更新了prim寻宝的python写法
---
 problems/kamacoder/0053.寻宝-prim.md | 34 ++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)

diff --git a/problems/kamacoder/0053.寻宝-prim.md b/problems/kamacoder/0053.寻宝-prim.md
index 782bd143..18256db8 100644
--- a/problems/kamacoder/0053.寻宝-prim.md
+++ b/problems/kamacoder/0053.寻宝-prim.md
@@ -521,6 +521,40 @@ int main() {
 ### Java 
 
 ### Python
+```python
+# 接收输入
+v, e = list(map(int, input().strip().split()))
+# 按照常规的邻接矩阵存储图信息，不可达的初始化为10001
+graph = [[10001] * (v+1) for _ in range(v+1)]
+for _ in range(e):
+    x, y, w = list(map(int, input().strip().split()))
+    graph[x][y] = w
+    graph[y][x] = w
+
+# 定义加入生成树的标记数组和未加入生成树的最近距离
+visited = [False] * (v + 1)
+minDist = [10001] * (v + 1)
+
+# 循环 n - 1 次，建立 n - 1 条边
+# 从节点视角来看：每次选中一个节点加入树，更新剩余的节点到树的最短距离，
+# 这一步其实蕴含了确定下一条选取的边，计入总路程 ans 的计算
+for _ in range(1, v + 1):
+    min_val = 10002
+    cur = -1
+    for j in range(1, v + 1):
+        if visited[j] == False and minDist[j] < min_val:
+            cur = j
+            min_val = minDist[j]
+    visited[cur] = True
+    for j in range(1, v + 1):
+        if visited[j] == False and minDist[j] > graph[cur][j]:
+            minDist[j] = graph[cur][j]
+
+ans = 0
+for i in range(2, v + 1):
+    ans += minDist[i]
+print(ans)
+```
 
 ### Go