Class EdgeBetweennessClusterer<V,E>
java.lang.Object
edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer<V,E>
- All Implemented Interfaces:
com.google.common.base.Function<Graph<V,
,E>, Set<Set<V>>> Function<Graph<V,
E>, Set<Set<V>>>
public class EdgeBetweennessClusterer<V,E>
extends Object
implements com.google.common.base.Function<Graph<V,E>,Set<Set<V>>>
An algorithm for computing clusters (community structure) in graphs based on edge betweenness.
The betweenness of an edge is defined as the extent to which that edge lies along
shortest paths between all pairs of nodes.
This algorithm works by iteratively following the 2 step process:
- Compute edge betweenness for all edges in current graph
- Remove edge with highest betweenness
Running time is: O(kmn) where k is the number of edges to remove, m is the total number of edges, and n is the total number of vertices. For very sparse graphs the running time is closer to O(kn^2) and for graphs with strong community structure, the complexity is even lower.
This algorithm is a slight modification of the algorithm discussed below in that the number of edges to be removed is parameterized.
- See Also:
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate int
-
Constructor Summary
ConstructorsConstructorDescriptionEdgeBetweennessClusterer
(int numEdgesToRemove) Constructs a new clusterer for the specified graph. -
Method Summary
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface com.google.common.base.Function
equals
-
Field Details
-
mNumEdgesToRemove
private int mNumEdgesToRemove -
edges_removed
-
-
Constructor Details
-
EdgeBetweennessClusterer
public EdgeBetweennessClusterer(int numEdgesToRemove) Constructs a new clusterer for the specified graph.- Parameters:
numEdgesToRemove
- the number of edges to be progressively removed from the graph
-
-
Method Details
-
apply
Finds the set of clusters which have the strongest "community structure". The more edges removed the smaller and more cohesive the clusters. -
getEdgesRemoved
Retrieves the list of all edges that were removed (assuming extract(...) was previously called). The edges returned are stored in order in which they were removed.- Returns:
- the edges in the original graph
-