Changeset 11 for src/main/java/weka/clusterers/forMetisMQI/GraphAlgorithms.java

Timestamp:

Sep 16, 2010, 10:44:40 AM (14 years ago)

Author:

gnappo

Message:

Un po' di refactoring e implementazione dell'algoritmo di raffinamento.

File:

• src/main/java/weka/clusterers/forMetisMQI/GraphAlgorithms.java (modified) (3 diffs)

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

@@ -3 +3 @@
 import java.util.Stack;
 
+import weka.clusterers.forMetisMQI.coarse.Coarse;
+import weka.clusterers.forMetisMQI.coarse.CoarserGraphElement;
+import weka.clusterers.forMetisMQI.graph.Bisection;
+import weka.clusterers.forMetisMQI.graph.Node;
+import weka.clusterers.forMetisMQI.graph.UndirectedGraph;
+
 public class GraphAlgorithms {
         
-        public KLPartition KL(UndirectedGraph g) {
-                KLPartition partition = new KLPartition(g);
-                KLPartition result = partition;
+        public Bisection KL(UndirectedGraph g) {
+                Bisection partition = new Bisection(g);
+                Bisection result = partition;
                 int bestEdgeCut = Integer.MAX_VALUE;
                 Node u = partition.getCandidate();
@@ -22 +28 @@
         
         public void METIS(UndirectedGraph g) {
-                KLPartition partition = null;
+                MQI.viewGraph(g);
+                Bisection partition = null;
                 Coarse.setFinerSize(8);
                 Stack<CoarserGraphElement> stack = Coarse.coarse(g);
-                
                 if(stack.size() > 0) {
                         partition = KL(stack.peek().getContracted());
@@ -32 +38 @@
                         System.out.println(partition.toString());
                 }
-                
-                MQI.start(partition);
+                System.out.println("AAAAAA");
+                System.out.println(MQI.mqi(partition).toString());
                 
         }