2020-07-10 23:29:02

docs/dsal/70.md

@@ -29,37 +29,37 @@ Prim 的算法是[最小生成树](/dsa/spanning-tree-and-minimum-spanning-tree#
 
 ![Start with a weighted graph](img/3fa02a92a42fb716698c94c7be00d3b2.png "Prim's Algorithm Steps")
 
-Start with a weighted graph
+从加权图开始
 
 
 
 ![Choose a vertex](img/0a9c87dbc27df22e75cccdd13a84a82a.png "Prim's Algorithm Steps")
 
-Choose a vertex
+选择一个顶点
 
 
 
 ![Choose the shortest edge from this vertex and add it](img/c04ae230a37b672c7809bef2d94e39e7.png "Prim's Algorithm Steps")
 
-Choose the shortest edge from this vertex and add it
+从该顶点选择最短边并添加
 
 
 
 ![Choose the nearest vertex not yet in the solution](img/1c5a44938d86cf9108395ec9ed21983b.png "Prim's Algorithm Steps")
 
-Choose the nearest vertex not yet in the solution
+选择尚未在解决方案中的最近顶点
 
 
 
 ![Choose the nearest edge not yet in the solution, if there are multiple choices, choose one at random](img/c08c1ea47dae5eefa399f8f9a7d38a67.png "Prim's Algorithm Steps")
 
-Choose the nearest edge not yet in the solution, if there are multiple choices, choose one at random
+选择尚未出现在解决方案中的最近边，如果有多个选择，请随机选择一个
 
 
 
 ![Repeat until you have a spanning tree](img/63d1afb08e6d96c07ca2b18318cd3200.png "Prim's Algorithm Steps")
 
-Repeat until you have a spanning tree
+重复直到您有一棵生成树
 
 
 

docs/dsal/71.md

@@ -16,7 +16,7 @@
 
 ![string](img/6df895dd4075ff8db996f95fb5ee0f53.png "initial string")
 
-Initial string
+初始字符串
 
 
 
@@ -106,7 +106,7 @@ Initial string
 
 ![huffman coding](img/3f9b94165cfae4f294e966f774fc408c.png "decoding")
 
-Decoding
+解码
 
 
 

docs/dsal/74.md

@@ -20,7 +20,7 @@ Floyd-Warhshall 算法也称为 Floyd 算法，Roy-Floyd 算法，Roy-Warshall
 
 ![graph](img/f277c24eccc3215db62e615adb24bba1.png "initial graph")
 
-Initial graph
+初始图
 
 
 

docs/dsal/75.md

@@ -43,13 +43,13 @@ S2 = {A, C, D, B, A, C}
 
 ![Longest Common Subsequence first sequence](img/6d52d05e3d4616ea7fee279f86768326.png "The first sequence")
 
-The first sequence
+第一个序列
 
 
 
 ![Longest Common Subsequence first sequence](img/212eafa19474813682c8d41d0f95be4d.png "Second Sequence")
 
-Second Sequence
+第二个序列
 
 
 

docs/dsal/77.md

@@ -20,7 +20,7 @@
 
 ![State Space Tree](img/243be31a01580585814a52b910267698.png "State Space Tree")
 
-State Space Tree
+状态空间树
 
 
 
@@ -49,7 +49,7 @@ Backtrack(x)
 
 ![All the possibilities](img/31f10d836e403a22a71b66acdaeee388.png "All possibilities")
 
-All the possibilities
+所有可能性
 
 
 
@@ -57,7 +57,7 @@ All the possibilities
 
 ![State state tree](img/10ceaf21203efe4c304c8cf17ed56140.png "State state tree")
 
-State tree with all the solutions
+状态树与所有解决方案