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

Timestamp:

Sep 17, 2010, 1:09:06 PM (14 years ago)

Author:

gnappo

Message:

Ulteriori refactoring. Creato il clusterer metisMqi, con opzioni.

File:

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

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

@@ -5 +5 @@
 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;
+import weka.clusterers.forMetisMQI.util.CoarserGraphElement;
+import weka.clusterers.forMetisMQI.util.Util;
 
 public class GraphAlgorithms {
 
-        public Bisection KL(UndirectedGraph g) {
+        
+        /**
+         * Given an undirected graph, performs the Kernighan-Li algorithm to find a bisection and
+         * then returns it.
+         * @param g
+         * @return
+         */
+        static public Bisection KL(UndirectedGraph g) {
                 Bisection partition = new Bisection(g);
                 Bisection result = partition;
@@ -28 +35 @@
                 return result;
         }
+        
+        static public Bisection metis(UndirectedGraph g, int sizeFinerGraph) {
+                Coarse.setFinerSize(sizeFinerGraph);
+                Stack<CoarserGraphElement> stack = Coarse.coarse(g);
+                Bisection partition = null;
+                if (stack.size() > 0) {
+                        partition = KL(stack.peek().getContracted());
+                        partition = Uncoarse.uncoarse(stack, partition);
+                }
+                return partition;
+        }
 
-        public void METIS(UndirectedGraph g) {
-//              MQI.viewGraph(g);
+        /**
+         * Given an UndirectedGraph, runs metis+mqi for <code>numberOfCluster</code> times and
+         * returns a set of clusters. With the third parameter you can control the maximum size of the finer
+         * graph during the coarsening phase.  
+         * @param g
+         * @param numberOfCluster
+         * @param sizeFinerGraph
+         */
+        static public Set<Set<Node>> metisMqi(UndirectedGraph g, int numberOfCluster, int sizeFinerGraph) {
                 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);
-                        }
+                for (int i = 0; i < numberOfCluster; i++) {
+                        Bisection partition = metis(g,sizeFinerGraph);
+                        Set<Node> cluster = MQI.mqi(partition);
+                        clusters.add(cluster);
                 }
-                MQI.viewClusters(g, clusters);
+                return clusters;
         }