Package org.jgrapht.alg
Algorithms provided with JGraphT.
-
Interface Summary Interface Description PathValidator<V,E> Deprecated. UsePathValidator
instead. -
Class Summary Class Description AbstractPathElement<V,E> Deprecated. moved in shortest path packageAbstractPathElementList<V,E,T extends AbstractPathElement<V,E>> Deprecated. moved in shortest path packageAllDirectedPaths<V,E> Deprecated. In favor ofAllDirectedPaths
.AStarShortestPath<V,E> Deprecated. in favor ofAStarShortestPath
BellmanFordIterator<V,E> Deprecated. moved into shortest path packageBellmanFordPathElement<V,E> Deprecated. moved into shortest path packageBellmanFordShortestPath<V,E> Deprecated. in favor ofBellmanFordShortestPath
BiconnectivityInspector<V,E> Inspects a graph for the biconnectivity property.BidirectionalDijkstraShortestPath<V,E> Deprecated. in favor ofBidirectionalDijkstraShortestPath
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> This class implements Bron-Kerbosch clique detection algorithm as it is described in [Samudrala R.,Moult J.:A Graph-theoretic 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 MCS-M+ 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 ofDijkstraShortestPath
DirectedNeighborIndex<V,E> Maintains a cache of each vertex's neighbors.EdmondsBlossomShrinking<V,E> Deprecated. UseEdmondsBlossomShrinking
instead.EulerianCircuit Deprecated. useHierholzerEulerianCycle
insteadFloydWarshallShortestPaths<V,E> Deprecated. In favor ofFloydWarshallShortestPaths
.GabowStrongConnectivityInspector<V,E> Allows obtaining the strongly connected components of a directed graph.GabowStrongConnectivityInspector.VertexNumber<V> GreedyMultiplicativeSpanner<V,E> Deprecated. UseGreedyMultiplicativeSpanner
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. UseHopcroftKarpBipartiteMatching
instead.KosarajuStrongConnectivityInspector<V,E> Complements theConnectivityInspector
class with the capability to compute the strongly connected components of a directed graph.KosarajuStrongConnectivityInspector.VertexData<V> KosarajuStrongConnectivityInspector.VertexData1<V> KosarajuStrongConnectivityInspector.VertexData2<V> KruskalMinimumSpanningTree<V,E> Deprecated. UseKruskalMinimumSpanningTree
instead.KShortestPaths<V,E> Deprecated. UseKShortestPaths
instead.KShortestPathsIterator<V,E> Deprecated. Moved in shortest path packageKuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> Deprecated. UseKuhnMunkresMinimalWeightBipartitePerfectMatching
instead.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,E> The actual implementation.MaximumWeightBipartiteMatching<V,E> Deprecated. UseMaximumWeightBipartiteMatching
instead.NaiveLcaFinder<V,E> Find the Lowest Common Ancestor of a directed graph.NeighborIndex<V,E> Maintains a cache of each vertex's neighbors.NeighborIndex.Neighbors<V> Stores cached neighbors for a single vertex.PrimMinimumSpanningTree<V,E> Deprecated. UsePrimMinimumSpanningTree
instead.RankingPathElement<V,E> Deprecated. UseRankingPathElement
instead.RankingPathElementList<V,E> Deprecated. UseRankingPathElement
instead.RankingPathElementList.PathMask<V,E> StoerWagnerMinimumCut<V,E> Implements the Stoer and Wagner minimum cut algorithm.TarjanLowestCommonAncestor<V,E> Used to calculate Tarjan's Lowest Common Ancestors AlgorithmTarjanLowestCommonAncestor.LcaRequestResponse<V> Data transfer object for LCA request and response.TarjanLowestCommonAncestor.MultiMap<V> TransitiveClosure Constructs the transitive closure of the input graph.TransitiveReduction An implementation of Harry Hsu's transitive reduction algorithm. -
Exception Summary Exception Description CycleDetector.CycleDetectedException Exception thrown internally when a cycle is detected during a yes/no cycle test.