Package | Description |
---|---|
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.
|
Modifier and Type | Class and Description |
---|---|
class |
BicomponentClusterer
Finds all biconnected components (bicomponents) of an undirected graph.
|
class |
EdgeBetweennessClusterer
An algorithm for computing clusters (community structure) in graphs based on edge betweenness.
|
class |
WeakComponentClusterer
Finds all weak components in a graph where a weak component is defined as
a maximal subgraph in which all pairs of vertices in the subgraph are reachable from one
another in the underlying undirected subgraph.
|