Package org.jgrapht.alg

Algorithms provided with JGraphT.

See:
Description

Class Summary

BellmanFordShortestPath<V,E>	Bellman-Ford algorithm: weights could be negative, paths could be constrained by a maximum number of edges.
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>	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.
ConnectivityInspector<V,E>	Allows obtaining various connectivity aspects of a graph.
CycleDetector<V,E>	Performs cycle detection on a graph.
DijkstraShortestPath<V,E>	An implementation of Dijkstra's shortest path algorithm using ClosestFirstIterator.
DirectedNeighborIndex<V,E>	Maintains a cache of each vertex's neighbors.
KShortestPaths<V,E>	The algorithm determines the k shortest simple paths in increasing order of weight.
NeighborIndex<V,E>	Maintains a cache of each vertex's neighbors.
StrongConnectivityInspector<V,E>	Complements the ConnectivityInspector class with the capability to compute the strongly connected components of a directed graph.
TransitiveClosure	Constructs the transitive closure of the input graph.
VertexCovers	Algorithms to find a vertex cover for a graph.

Package org.jgrapht.alg Description

Algorithms provided with JGraphT.