| Class | Description |
|---|---|
| BiconnectivityInspector<V,E> |
Inspects a graph for the biconnectivity property.
|
| BlockCutpointGraph<V,E> |
Definition of a block of a graph in
MathWorld.
Definition and lemma taken from the article Structure-Based Resilience Metrics for Service-Oriented Networks: Definition 4.5 Let G(V; E) be a connected undirected graph. |
| BronKerboschCliqueFinder<V,E> | Deprecated
In favor of
BronKerboschCliqueFinder. |
| ChromaticNumber | Deprecated
Use the classes implementing
VertexColoringAlgorithm instead. |
| CliqueMinimalSeparatorDecomposition<V,E> | Deprecated
Use
CliqueMinimalSeparatorDecomposition instead. |
| ConnectivityInspector<V,E> |
Allows obtaining various connectivity aspects of a graph.
|
| CycleDetector<V,E> |
Performs cycle detection on a graph.
|
| DirectedNeighborIndex<V,E> | Deprecated
Use
NeighborCache instead. |
| GabowStrongConnectivityInspector<V,E> |
Computes the strongly connected components of a directed graph.
|
| HamiltonianCycle | Deprecated
Use
TwoApproxMetricTSP instead. |
| KosarajuStrongConnectivityInspector<V,E> |
Computes strongly connected components of a directed graph.
|
| NaiveLcaFinder<V,E> |
Find the Lowest Common Ancestor of a directed graph.
|
| NeighborIndex<V,E> | Deprecated
Use
NeighborCache instead. |
| StoerWagnerMinimumCut<V,E> |
Implements the Stoer and Wagner minimum cut
algorithm.
|
| TarjanLowestCommonAncestor<V,E> |
Used to calculate Tarjan's Lowest Common Ancestors Algorithm
|
| TarjanLowestCommonAncestor.LcaRequestResponse<V> |
Data transfer object for LCA request and response.
|
| TransitiveClosure |
Constructs the transitive closure of the input graph.
|
| TransitiveReduction |
An implementation of Harry Hsu's
transitive reduction algorithm.
|
Copyright © 2017. All rights reserved.