Uses of Class
edu.uci.ics.jung.algorithms.cluster.ClusterSet

Packages that use ClusterSet
edu.uci.ics.jung.algorithms.cluster Provides a series of methods for locating clusters in graphs according to some model-based, heuristic or graph-theoretic criteria. 
 

Uses of ClusterSet in edu.uci.ics.jung.algorithms.cluster
 

Subclasses of ClusterSet in edu.uci.ics.jung.algorithms.cluster
 class EdgeClusterSet
          A ClusterSet where each cluster is a set of edge
 class VertexClusterSet
          A ClusterSet where each cluster is a set of vertices
 

Methods in edu.uci.ics.jung.algorithms.cluster that return ClusterSet
abstract  ClusterSet ClusterSet.createEquivalentClusterSet(Graph anotherGraph)
          Returns the corresponding cluster set in the other graph.
 ClusterSet EdgeClusterSet.createEquivalentClusterSet(Graph anotherGraph)
          Creates a new cluster set where each edge and cluster in the new cluster set correspond 1-to-1 with those in the original graph
 ClusterSet VertexClusterSet.createEquivalentClusterSet(Graph anotherGraph)
          Creates a new cluster set where each vertex and cluster in the new cluster set correspond 1-to-1 with those in the original graph
 ClusterSet BicomponentClusterer.extract(ArchetypeGraph theGraph)
          Extracts the bicomponents from the graph
 ClusterSet EdgeBetweennessClusterer.extract(ArchetypeGraph g)
          Finds the set of clusters which have the strongest "community structure".
 ClusterSet GraphClusterer.extract(ArchetypeGraph graph)
          Extracts the clusters from a graph.
 ClusterSet WeakComponentClusterer.extract(ArchetypeGraph aGraph)
          Extracts the weak components from a graph.
 

Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type ClusterSet
protected  void BicomponentClusterer.findBiconnectedComponents(Vertex v, ClusterSet bicomponents)
          Stores, in bicomponents, all the biconnected components that are reachable from v.