Package org.jgrapht.alg
package org.jgrapht.alg
Algorithms provided with JGraphT.
-
ClassesClassDescriptionBellman-Ford algorithm: weights could be negative, paths could be constrained by a maximum number of edges.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.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.Allows the chromatic number of a graph to be calculated.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 usingClosestFirstIterator
.Maintains a cache of each vertex's neighbors.A flow network is a directed graph where each edge has a capacity and each edge receives a flow.This algorithm will check whether a graph is Eulerian (hence it contains an Eulerian circuit).The Floyd-Warshall algorithm finds all shortest paths (all n^2 of them) in O(n^3) time.This class will deal with finding the optimal or approximately optimal minimum tour (hamiltonian cycle) or commonly known as the Traveling Salesman Problem.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.Complements theConnectivityInspector
class with the capability to compute the strongly connected components of a directed graph.Constructs the transitive closure of the input graph.Algorithms to find a vertex cover for a graph.