- Timestamp:
- Sep 17, 2010, 6:04:18 PM (14 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/main/java/weka/clusterers/forMetisMQI/GraphAlgorithms.java
r14 r15 57 57 static public Set<Set<Node>> metisMqi(UndirectedGraph g, int numberOfCluster, int sizeFinerGraph) { 58 58 Set<Set<Node>> clusters = new HashSet<Set<Node>>(); 59 Util.viewGraph(g); 59 60 for (int i = 0; i < numberOfCluster; i++) { 60 61 Bisection partition = metis(g,sizeFinerGraph); 61 62 Set<Node> cluster = MQI.mqi(partition); 62 63 clusters.add(cluster); 64 System.out.println("CLUSTER "+ i + ": " + cluster); 63 65 } 64 66 return clusters;
Note: See TracChangeset
for help on using the changeset viewer.