githubyhx
diff --git a/‎.idea/misc.xml‎
Lines changed: 4 additions & 21 deletions b/‎.idea/misc.xml‎
Lines changed: 4 additions & 21 deletions
diff --git a/‎src/com/zejian/structures/Graph/WeightGraph/Edge.java‎
Lines changed: 3 additions & 3 deletions b/‎src/com/zejian/structures/Graph/WeightGraph/Edge.java‎
Lines changed: 3 additions & 3 deletions
diff --git a/‎src/com/zejian/structures/Graph/WeightGraph/KruskalMST.java‎
Lines changed: 1 addition & 1 deletion b/‎src/com/zejian/structures/Graph/WeightGraph/KruskalMST.java‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎src/com/zejian/structures/Graph/WeightGraph/WeightSparseGraph.java‎
Lines changed: 3 additions & 3 deletions b/‎src/com/zejian/structures/Graph/WeightGraph/WeightSparseGraph.java‎
Lines changed: 3 additions & 3 deletions
@@ -18,9 +18,9 @@ public Edge(int v, int w, Weight weight) {
 
     public Edge(Edge<Weight> e)
     {
-        this.v = e.w;
-        this.w = e.w;
-        this.weight = e.weight;
+        this.v = e.v();
+        this.w = e.w();
+        this.weight = e.wt();
     }
 
     /**
 
@@ -63,7 +63,7 @@ public KruskalMST(WeightGraph graph){
         //计算最小生成树的总权值
         mstWeight = mst.get(0).wt().doubleValue();
         for (int i = 1; i < mst.size() ; i++) {
-            mstWeight =mstWeight.doubleValue() + mst.get(0).wt().doubleValue();
+            mstWeight =mstWeight.doubleValue() + mst.get(i).wt().doubleValue();
         }
     }
 
 
@@ -41,9 +41,9 @@ public void addEdge(Edge e) {
         assert e.v() >= 0 && e.v() < V ;
         assert e.w() >= 0 && e.w() < V ;
 
-        g[e.v()].add(e);
+        g[e.v()].add(new Edge<Weight>(e));
         if( e.v() != e.w() && !directed ) {
-            g[e.w()].add(e);
+            g[e.w()].add(new Edge<Weight>(e.w(),e.v(), (Weight) e.wt()));
         }
         E++;
     }
@@ -89,7 +89,7 @@ public void show(){
      * @param args
      */
     public static void main(String[] args){
-        String filename = "weighttestG3.txt";
+        String filename = "testWG1.txt";
 
         WeightSparseGraph<Double> weightSparseGraph = new WeightSparseGraph<>(8,false);
         weightSparseGraph.readGraph(filename);
Original file line number	Diff line number	Diff line change
`@@ -18,9 +18,9 @@ public Edge(int v, int w, Weight weight) {`
`18`	`18`
`19`	`19`	`public Edge(Edge<Weight> e)`
`20`	`20`	`{`
`21`		`- this.v = e.w;`
`22`		`- this.w = e.w;`
`23`		`- this.weight = e.weight;`
	`21`	`+ this.v = e.v();`
	`22`	`+ this.w = e.w();`
	`23`	`+ this.weight = e.wt();`
`24`	`24`	`}`
`25`	`25`
`26`	`26`	`/**`
Original file line number	Diff line number	Diff line change
`@@ -63,7 +63,7 @@ public KruskalMST(WeightGraph graph){`
`63`	`63`	`//计算最小生成树的总权值`
`64`	`64`	`mstWeight = mst.get(0).wt().doubleValue();`
`65`	`65`	`for (int i = 1; i < mst.size() ; i++) {`
`66`		`- mstWeight =mstWeight.doubleValue() + mst.get(0).wt().doubleValue();`
	`66`	`+ mstWeight =mstWeight.doubleValue() + mst.get(i).wt().doubleValue();`
`67`	`67`	`}`
`68`	`68`	`}`
`69`	`69`