Changeset 20 for src/main/java/weka/clusterers/forMetisMQI/graph

Timestamp:

Sep 30, 2010, 5:33:45 PM (14 years ago)

Author:

gnappo

Message:

Aggiunto metodo per stampare i grafi in formato utile per kmetis; modificato politica di azione di mqi, ora agisce sulla partizione piu` grande.

Location:

src/main/java/weka/clusterers/forMetisMQI/graph

Files:

• Bisection.java (modified) (1 diff)
• UndirectedGraph.java (modified) (2 diffs)

src/main/java/weka/clusterers/forMetisMQI/graph/Bisection.java

@@ -139 +139 @@
         }
         
+        public Subgraph getLargerSubgraph() {
+                if(a.getVertexCount() < b.getVertexCount())
+                        return b;
+                else
+                        return a;
+        }
+        
         /**
-         * Returns the smaller not empty subgraph of this bisection, null otherwise.
+         * Returns the smaller subgraph of this bisection, null otherwise.
          * @return
          */
-        public Subgraph getSmallerNotEmptySubgraph() {
-                if(a.getVertexCount() > 0 && b.getVertexCount() == 0)
-                        return a;
-                if(b.getVertexCount() > 0 && a.getVertexCount() == 0)
-                        return b;
+        public Subgraph getSmallerSubgraph() {
                 if(a.getVertexCount() < b.getVertexCount())
                         return a;

src/main/java/weka/clusterers/forMetisMQI/graph/UndirectedGraph.java

@@ -1 +1 @@
 package weka.clusterers.forMetisMQI.graph;
 
+import java.io.PrintStream;
 import java.util.ArrayList;
 import java.util.Collection;
+import java.util.HashMap;
 import java.util.Iterator;
 import java.util.List;
+import java.util.TreeMap;
 
 import weka.clusterers.forMetisMQI.Random;
@@ -109 +112 @@
         }
         
+        public void printForMetis(PrintStream output) {
+                TreeMap<Integer,Node> map = new TreeMap<Integer,Node>();
+                HashMap<Node,Integer> reverseMap = new HashMap<Node,Integer>();
+                Iterator<Node> nodesIterator = getVertices().iterator();
+                int id = 1;
+                while(nodesIterator.hasNext()) {
+                        Node node = nodesIterator.next();
+                        map.put(id, node);
+                        reverseMap.put(node,id);
+                        id++;
+                }
+                output.println(getVertexCount() + " "+ getEdgeCount());
+                Iterator<Integer> mappedIterator = map.keySet().iterator();
+                while(mappedIterator.hasNext()) {
+                        id = mappedIterator.next();
+                        Iterator<Node> neighbors = getNeighbors(map.get(id)).iterator();
+                        while(neighbors.hasNext()){
+                                output.print(reverseMap.get(neighbors.next()));
+                                if(neighbors.hasNext()) output.print(" ");
+                        }
+                        output.println();
+                }
+        }
+        
         public String toString() {
                 StringBuffer sb = new StringBuffer("Vertices:");