- Timestamp:
- Oct 5, 2010, 9:55:49 PM (14 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/main/java/weka/clusterers/forMetisMQI/GraphAlgorithms.java
r22 r23 11 11 import weka.clusterers.forMetisMQI.graph.UndirectedGraph; 12 12 import weka.clusterers.forMetisMQI.util.CoarserGraphElement; 13 import weka.clusterers.forMetisMQI.util.GraphsFrame; 13 14 import weka.clusterers.forMetisMQI.util.Util; 14 15 … … 81 82 */ 82 83 static public Set<Set<Node>> metisMqi(UndirectedGraph g, int numberOfCluster, int sizeFinerGraph, boolean randomBisection) { 84 GraphsFrame gf = new GraphsFrame("Prova"); 83 85 System.out.println("Vertex count: " + g.getVertexCount()); 84 86 System.out.println("Edges count: " + g.getEdgeCount()); … … 93 95 Set<Set<Node>> clusters = new HashSet<Set<Node>>(); 94 96 UndirectedGraph gclone = g.clone(); 95 // Util.viewGraph(g);97 gf.addPanel(Util.panelGraph(gclone)); 96 98 for (int i = 0; i < numberOfCluster; i++) { 97 99 Bisection bisection = null; … … 125 127 } 126 128 } 127 Util.viewClusters(gclone, clusters); 129 gf.addPanel(Util.panelClusters(gclone, clusters)); 130 gf.setVisible(true); 128 131 return clusters; 129 132 }
Note: See TracChangeset
for help on using the changeset viewer.