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

Timestamp:

Sep 16, 2010, 7:01:57 PM (14 years ago)

Author:

gnappo

Message:

Visualizzazione dei cluster. (da spostare)

File:

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

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

@@ -1 +1 @@
 package weka.clusterers.forMetisMQI;
 
+import java.util.HashSet;
+import java.util.Set;
 import java.util.Stack;
 
@@ -10 +12 @@
 
 public class GraphAlgorithms {
-        
+
         public Bisection KL(UndirectedGraph g) {
                 Bisection partition = new Bisection(g);
@@ -16 +18 @@
                 int bestEdgeCut = Integer.MAX_VALUE;
                 Node u = partition.getCandidate();
-                while(u != null) {
+                while (u != null) {
                         partition.swap(u);
-                        if(partition.edgeCut() <=  bestEdgeCut) {
+                        if (partition.edgeCut() <= bestEdgeCut) {
                                 bestEdgeCut = partition.edgeCut();
                                 result = partition.copy();
@@ -26 +28 @@
                 return result;
         }
-        
+
         public void METIS(UndirectedGraph g) {
-                MQI.viewGraph(g);
-                Bisection partition = null;
-                Coarse.setFinerSize(8);
-                Stack<CoarserGraphElement> stack = Coarse.coarse(g);
-                if(stack.size() > 0) {
-                        partition = KL(stack.peek().getContracted());
-                        System.out.println(partition.toString());
-                        partition = new Uncoarse().uncoarse(stack, partition);
-                        System.out.println(partition.toString());
+//              MQI.viewGraph(g);
+                Set<Set<Node>> clusters = new HashSet<Set<Node>>();
+                for (int i = 0; i < 8; i++) {
+                        Coarse.setFinerSize(8);
+                        Stack<CoarserGraphElement> stack = Coarse.coarse(g);
+                        Bisection partition = null;
+                        if (stack.size() > 0) {
+                                partition = KL(stack.peek().getContracted());
+//                              System.out.println(partition.toString());
+                                partition = new Uncoarse().uncoarse(stack, partition);
+//                              System.out.println(partition.toString());
+                                Set<Node> cluster = MQI.mqi(partition);
+                                clusters.add(cluster);
+//                              Set<Set<Node>> foundCluster = new HashSet<Set<Node>>();
+//                              foundCluster.add(cluster);
+//                              MQI.viewClusters(g, foundCluster);
+                        }
                 }
-                System.out.println("AAAAAA");
-                System.out.println(MQI.mqi(partition).toString());
-                
+                MQI.viewClusters(g, clusters);
         }