Interface  Description 

PathValidator<V,E>  Deprecated
Use
PathValidator instead. 
Class  Description 

AllDirectedPaths<V,E>  Deprecated
In favor of
AllDirectedPaths . 
AStarShortestPath<V,E>  Deprecated
in favor of
AStarShortestPath 
BellmanFordShortestPath<V,E>  Deprecated
in favor of
BellmanFordShortestPath 
BiconnectivityInspector<V,E> 
Inspects a graph for the biconnectivity property.

BidirectionalDijkstraShortestPath<V,E>  Deprecated
in favor of
BidirectionalDijkstraShortestPath 
BlockCutpointGraph<V,E> 
Definition of a block of a graph in
MathWorld.
Definition and lemma taken from the article StructureBased Resilience Metrics for ServiceOriented Networks: Definition 4.5 Let G(V; E) be a connected undirected graph. 
BronKerboschCliqueFinder<V,E> 
This class implements BronKerbosch clique detection algorithm as it is described in [Samudrala
R.,Moult J.:A Graphtheoretic Algorithm for comparative Modeling of Protein Structure; J.Mol.

ChromaticNumber 
Allows the chromatic number of a
graph to be calculated.

CliqueMinimalSeparatorDecomposition<V,E> 
Clique Minimal Separator Decomposition using MCSM+ and Atoms algorithm as described in Berry et
al.

ConnectivityInspector<V,E> 
Allows obtaining various connectivity aspects of a graph.

CycleDetector<V,E> 
Performs cycle detection on a graph.

DijkstraShortestPath<V,E>  Deprecated
in favor of
DijkstraShortestPath 
DirectedNeighborIndex<V,E> 
Maintains a cache of each vertex's neighbors.

EdmondsBlossomShrinking<V,E>  Deprecated
Use
EdmondsBlossomShrinking instead. 
EulerianCircuit  Deprecated
use
HierholzerEulerianCycle instead 
FloydWarshallShortestPaths<V,E>  Deprecated
In favor of
FloydWarshallShortestPaths . 
GabowStrongConnectivityInspector<V,E> 
Allows obtaining the strongly connected components of a directed graph.

GreedyMultiplicativeSpanner<V,E>  Deprecated
Use
GreedyMultiplicativeSpanner instead. 
HamiltonianCycle 
This class will deal with finding the optimal or approximately optimal minimum tour (hamiltonian
cycle) or commonly known as the
Traveling Salesman
Problem.

HopcroftKarpBipartiteMatching<V,E>  Deprecated
Use
HopcroftKarpBipartiteMatching instead. 
KosarajuStrongConnectivityInspector<V,E> 
Complements the
ConnectivityInspector class with the capability to
compute the strongly connected components of a directed graph. 
KruskalMinimumSpanningTree<V,E>  Deprecated
Use
KruskalMinimumSpanningTree instead. 
KShortestPaths<V,E>  Deprecated
Use
KShortestPaths instead. 
KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E>  Deprecated
Use
KuhnMunkresMinimalWeightBipartitePerfectMatching
instead. 
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,E> 
The actual implementation.

MaximumWeightBipartiteMatching<V,E>  Deprecated
Use
MaximumWeightBipartiteMatching instead. 
NaiveLcaFinder<V,E> 
Find the Lowest Common Ancestor of a directed graph.

NeighborIndex<V,E> 
Maintains a cache of each vertex's neighbors.

PrimMinimumSpanningTree<V,E>  Deprecated
Use
PrimMinimumSpanningTree 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.