KrusKal算法

Author: shinezejian

.idea/misc.xml

@@ -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();
     }
 
     /**

src/com/zejian/structures/Graph/WeightGraph/Edge.java

@@ -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();
         }
     }
 

src/com/zejian/structures/Graph/WeightGraph/KruskalMST.java

@@ -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);