EulerFormula
diff --git a/‎src/com/zejian/structures/Graph/WeightGraph/LazyPrimMST.java‎
Lines changed: 2 additions & 0 deletions b/‎src/com/zejian/structures/Graph/WeightGraph/LazyPrimMST.java‎
Lines changed: 2 additions & 0 deletions
diff --git a/‎src/com/zejian/structures/Graph/WeightGraph/TestMainForPrim.java‎
Lines changed: 5 additions & 0 deletions b/‎src/com/zejian/structures/Graph/WeightGraph/TestMainForPrim.java‎
Lines changed: 5 additions & 0 deletions
diff --git a/‎testWG1.txt‎
Lines changed: 17 additions & 0 deletions b/‎testWG1.txt‎
Lines changed: 17 additions & 0 deletions
@@ -12,6 +12,8 @@
  * 利用深度优先搜索算法遍历图,并标记已被访问过的顶点,同时利用最小堆的特性
  * 每一次切分,都将新的边的权值加入堆中,并获取从其中获取最小权值的元素,必
  * 为最小生成树的一条边的权值
+ *
+ * 时间复杂度 E * LogE（deleteMin方法执行的总时间复杂度） + E * LogE（visit方法执行的总时间复杂度） = E*LogE级别
  */
 public class LazyPrimMST<Weight extends Number & Comparable<Weight>> {
     private boolean visited[]; //标记已被访问过的顶点
 
@@ -0,0 +1,5 @@
+package com.zejian.structures.Graph.WeightGraph;
+
+public class TestMainForPrim {
+
+}
@@ -0,0 +1,17 @@
+8 16
+4 5 .35
+4 7 .37
+5 7 .28
+0 7 .16
+1 5 .32
+0 4 .38
+2 3 .17
+1 7 .19
+0 2 .26
+1 2 .36
+1 3 .29
+2 7 .34
+6 2 .40
+3 6 .52
+6 0 .58
+6 4 .93
-Original file line number
+Diff line change
@@ @@ -0,0 +1,5 @@ @@
 +package com.zejian.structures.Graph.WeightGraph;
++
 +public class TestMainForPrim {
++
 +}