|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||
| Packages that use ClusterSet | |
| edu.uci.ics.jung.algorithms.cluster | |
| 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 | |
ClusterSet |
WeakComponentClusterer.extract(Graph aGraph)
Extracts the weak components from a 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 |
GraphClusterer.extract(Graph graph)
Extracts the clusters from a 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 |
EdgeBetweennessClusterer.extract(Graph graph)
Finds the set of clusters which have the strongest "community structure". |
abstract ClusterSet |
ClusterSet.createEquivalentClusterSet(Graph anotherGraph)
Returns the corresponding cluster set in the other graph. |
ClusterSet |
BicomponentClusterer.extract(Graph theGraph)
Extracts the bicomponents from the graph |
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||