/*
* Copyright (c) 2003, The JUNG Authors
*
* All rights reserved.
*
* This software is open-source under the BSD license; see either
* "license.txt" or
* https://github.com/jrtom/jung/blob/master/LICENSE for a description.
*/
package edu.uci.ics.jung.algorithms.cluster;
import java.util.Collection;
import java.util.Set;
import junit.framework.Assert;
import junit.framework.Test;
import junit.framework.TestCase;
import junit.framework.TestSuite;
import com.google.common.base.Supplier;
import edu.uci.ics.jung.graph.Graph;
import edu.uci.ics.jung.graph.SparseMultigraph;
/**
* @author Scott White
*/
public class TestEdgeBetweennessClusterer extends TestCase {
public static Test suite() {
return new TestSuite(TestEdgeBetweennessClusterer.class);
}
Supplier> graphFactory;
Supplier vertexFactory;
Supplier edgeFactory;
@Override
protected void setUp() {
graphFactory = new Supplier>() {
public Graph get() {
return new SparseMultigraph();
}
};
vertexFactory = new Supplier() {
int n = 0;
public Integer get() { return n++; }
};
edgeFactory = new Supplier() {
int n = 0;
public Number get() { return n++; }
};
}
public void testRanker() {
Graph graph = new SparseMultigraph();
for(int i=0; i<10; i++) {
graph.addVertex(i+1);
}
int j=0;
graph.addEdge(j++,1,2);
graph.addEdge(j++,1,3);
graph.addEdge(j++,2,3);
graph.addEdge(j++,5,6);
graph.addEdge(j++,5,7);
graph.addEdge(j++,6,7);
graph.addEdge(j++,8,10);
graph.addEdge(j++,7,8);
graph.addEdge(j++,7,10);
graph.addEdge(j++,3,4);
graph.addEdge(j++,4,6);
graph.addEdge(j++,4,8);
Assert.assertEquals(graph.getVertexCount(),10);
Assert.assertEquals(graph.getEdgeCount(),12);
EdgeBetweennessClusterer clusterer = new EdgeBetweennessClusterer(3);
Collection> clusters = clusterer.apply(graph);
Assert.assertEquals(clusters.size(),3);
}
}
Ads help maintain this website.