import edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer; //导入依赖的package包/类
public static void cluster(AggregateLayout<VisualNode,VisualEdge> layout, int numEdgesToRemove, boolean groupClusters) {
	
	Graph<VisualNode,VisualEdge> g = layout.getGraph();
	layout.removeAll();
	
	EdgeBetweennessClusterer<VisualNode,VisualEdge> clusterer = new EdgeBetweennessClusterer<VisualNode,VisualEdge>(numEdgesToRemove);
	Set<Set<VisualNode>> clusterSet = clusterer.transform(g);
	List<VisualEdge> edges = clusterer.getEdgesRemoved();
	
	int i = 0;
	//Clusters have same color
	for (Iterator<Set<VisualNode>> cIt = clusterSet.iterator(); cIt.hasNext();) {
	
		Set<VisualNode> vertices = cIt.next();
		Color c = similarColors[i % similarColors.length];
		
		colorCluster(vertices, c);
		if(groupClusters == true) {
			groupCluster(layout, vertices);
		}
		i++;
	}
}
 

import edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer; //导入依赖的package包/类
public void clusterAndRecolor(SubLayoutDecorator layout,
	int numEdgesToRemove,
	Color[] colors, boolean groupClusters) {
	//Now cluster the vertices by removing the top 50 edges with highest betweenness
	//		if (numEdgesToRemove == 0) {
	//			colorCluster( g.getVertices(), colors[0] );
	//		} else {
	
	Graph g = layout.getGraph();
       layout.removeAllSubLayouts();

	EdgeBetweennessClusterer clusterer =
		new EdgeBetweennessClusterer(numEdgesToRemove);
	ClusterSet clusterSet = clusterer.extract(g);
	List edges = clusterer.getEdgesRemoved();

	int i = 0;
	//Set the colors of each node so that each cluster's vertices have the same color
	for (Iterator cIt = clusterSet.iterator(); cIt.hasNext();) {

		Set vertices = (Set) cIt.next();
		Color c = colors[i % colors.length];

		colorCluster(vertices, c);
		if(groupClusters == true) {
			groupCluster(layout, vertices);
		}
		i++;
	}
	for (Iterator it = g.getEdges().iterator(); it.hasNext();) {
		Edge e = (Edge) it.next();
		if (edges.contains(e)) {
			e.setUserDatum(DEMOKEY, Color.LIGHT_GRAY, UserData.REMOVE);
		} else {
			e.setUserDatum(DEMOKEY, Color.BLACK, UserData.REMOVE);
		}
	}

}
 

import edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer; //导入依赖的package包/类
/**
 * 
 * @param fraction -- the fraction of edges that should be removed. If set to 
 * {@value 0.0} then a default value of {@value 0.3}, i.e., 
 * {@value 30%} will be used.
 */
public void compute(double fraction) {
  int edgeCount = jungGraph.getEdgeCount();
  EdgeBetweennessClusterer<Integer, Integer> computer = 
      new EdgeBetweennessClusterer<>((int)(edgeCount * fraction));
  
  this.communities = computer.transform(jungGraph);
}
 

import edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer; //导入依赖的package包/类
public void clusterAndRecolor(AggregateLayout<Number,Number> layout,
	int numEdgesToRemove,
	Color[] colors, boolean groupClusters) {
	//Now cluster the vertices by removing the top 50 edges with highest betweenness
	//		if (numEdgesToRemove == 0) {
	//			colorCluster( g.getVertices(), colors[0] );
	//		} else {
	
	Graph<Number,Number> g = layout.getGraph();
       layout.removeAll();

	EdgeBetweennessClusterer<Number,Number> clusterer =
		new EdgeBetweennessClusterer<Number,Number>(numEdgesToRemove);
	Set<Set<Number>> clusterSet = clusterer.transform(g);
	List<Number> edges = clusterer.getEdgesRemoved();

	int i = 0;
	//Set the colors of each node so that each cluster's vertices have the same color
	for (Iterator<Set<Number>> cIt = clusterSet.iterator(); cIt.hasNext();) {

		Set<Number> vertices = cIt.next();
		Color c = colors[i % colors.length];

		colorCluster(vertices, c);
		if(groupClusters == true) {
			groupCluster(layout, vertices);
		}
		i++;
	}
	for (Number e : g.getEdges()) {

		if (edges.contains(e)) {
			edgePaints.put(e, Color.lightGray);
		} else {
			edgePaints.put(e, Color.black);
		}
	}

}
 

import edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
protected GraphClusterer obtainGraphClusterer() {
	return new EdgeBetweennessClusterer(numberOfEdges);
}