| Classes in edu.uci.ics.jung.algorithms.cluster that implement GraphClusterer |
class |
BicomponentClusterer
Finds all bicomponents (or blocks) in an undirected graph where a bicomponent is defined as s maximal set of nodes
and edges such that every pair of nodes is connected by two or more independent paths
Running time: O(|V| + |E|) where |V| is the number of vertices and |E| is the number of edges |
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.
|