|
Class Summary |
| 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 |
| ClusterSet |
A data structure representing the clusters, connected set of vertices (or edges), in a graph. |
| EdgeBetweennessClusterer |
An algorithm for computing clusters (community structure) in graphs based on edge betweenness.
|
| EdgeClusterSet |
A ClusterSet where each cluster is a set of edge |
| ExactFlowCommunity |
ExactFlowCommunity is an algorithm that uses a set of root nodes that are
supposed to be representative of a community to find the entire community
using principles based on max-flow/min-cut. |
| VertexClusterSet |
A ClusterSet where each cluster is a set of vertices |
| 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.
|