Changeset 7 for src/main/java/weka/clusterers/forMetisMQI/Graph.java

Timestamp:

Sep 10, 2010, 10:51:27 AM (14 years ago)

Author:

gnappo

Message:

Implementazione di Metis: aggiunta fase di uncoarsing e algoritmo di bisezione. Un po' di refactoring.

File:

• src/main/java/weka/clusterers/forMetisMQI/Graph.java (modified) (5 diffs)

src/main/java/weka/clusterers/forMetisMQI/Graph.java

@@ -6 +6 @@
 import java.util.Iterator;
 import java.util.List;
+import java.util.Map.Entry;
 
 import weka.core.Attribute;
@@ -41 +42 @@
                         return "Vwgt: " + vwgt + " Cewgt: " + cewgt + " Iedges: " + iedges
                                         + " Nedges: " + nedges + " Adjwgt: " + adjwgt;
+                }
+                
+                @Override
+                public NodeInfo clone() {
+                        NodeInfo ni = new NodeInfo();
+                        ni.adjwgt = adjwgt;
+                        ni.cewgt = cewgt;
+                        ni.iedges = iedges;
+                        ni.nedges = nedges;
+                        ni.vwgt = vwgt;
+                        return ni;
                 }
         }
@@ -107 +119 @@
          * @return
          */
-        private int getLabel(int index) {
+        public int getLabel(int index) {
                 return this.index.get(index);
         }
@@ -116 +128 @@
          * @return
          */
-        private int getIndex(int label) {
+        public int getIndex(int label) {
                 return this.label.get(label);
         }
@@ -307 +319 @@
                 }
         }
+        
+        
+        @Override
+        public Graph clone() {
+                Graph g = new Graph();
+                g.adjncy = new ArrayList<Integer>();
+                for(int i = 0; i < adjncy.size(); i++) {
+                        g.adjncy.add(adjncy.get(i));
+                }
+                
+                g.weights = new ArrayList<Integer>();
+                for(int i = 0; i < weights.size(); i++) {
+                        g.weights.add(weights.get(i));
+                }
+                
+                g.vtxs = new ArrayList<NodeInfo>();
+                for(int i = 0; i < vtxs.size(); i++) {
+                        g.vtxs.add(vtxs.get(i).clone());
+                }
+                
+                g.index = new HashMap<Integer, Integer>();
+                Iterator<Entry<Integer,Integer>> i = index.entrySet().iterator();
+                while(i.hasNext()) {
+                        Entry<Integer,Integer> entry = i.next();
+                        g.index.put(entry.getKey(), entry.getValue());
+                }
+                
+                g.label = new HashMap<Integer, Integer>();
+                i = label.entrySet().iterator();
+                while(i.hasNext()) {
+                        Entry<Integer,Integer> entry = i.next();
+                        g.label.put(entry.getKey(), entry.getValue());
+                }
+                
+                
+                return g;
+        }
 }