Module org.jgrapht.core
Package org.jgrapht.alg.interfaces
Algorithm related interfaces.

Interface Summary Interface Description AStarAdmissibleHeuristic<V> Interface for an admissible heuristic used in A* search.CapacitatedSpanningTreeAlgorithm<V,E> An algorithm which computes a capacitated (minimum) spanning tree of a given connected graph with a designated root vertex.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E> A spanning tree.CliqueAlgorithm<V> Algorithm to compute a (weighted) Clique in a graph.CliqueAlgorithm.Clique<V> A CliqueClusteringAlgorithm<V> An algorithm which computes a graph vertex clustering.ClusteringAlgorithm.Clustering<V> A clustering.CycleBasisAlgorithm<V,E> Allows to derive an undirected cycle basis of a given graph.CycleBasisAlgorithm.CycleBasis<V,E> An undirected cycle basis.EulerianCycleAlgorithm<V,E> Computes an Eulerian cycle of an Eulerian graph.FlowAlgorithm<V,E> Interface for flow algorithmsFlowAlgorithm.Flow<E> Represents a flow.HamiltonianCycleAlgorithm<V,E> An algorithm solving the Hamiltonian cycle problem.HamiltonianCycleImprovementAlgorithm<V,E> An algorithm improving the result of solving the Hamiltonian cycle problem.IndependentSetAlgorithm<V> Algorithm to compute an Independent Set in a graph.IndependentSetAlgorithm.IndependentSet<V> A (weighted) Independent SetKShortestPathAlgorithm<V,E> An algorithm which computes $k$shortest paths between vertices.LowestCommonAncestorAlgorithm<V> Algorithm to compute a lowest common ancestor in a tree, forest or DAG.ManyToManyShortestPathsAlgorithm<V,E> An algorithm which computes shortest paths from all sources to all targets.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> A set of paths from all sources vertices to all target vertices.MatchingAlgorithm<V,E> Allows to derive a matching of a given graph.MatchingAlgorithm.Matching<V,E> A graph matching.MaximalCliqueEnumerationAlgorithm<V,E> A maximal clique enumeration algorithm.MaximumDensitySubgraphAlgorithm<V,E> Interface for algorithms computing the maximum density subgraphMaximumFlowAlgorithm<V,E> Allows to derive maximumflow from the supplied flow networkMaximumFlowAlgorithm.MaximumFlow<E> A maximum flowMinimumCostFlowAlgorithm<V,E> Allows to calculate minimum cost flow on the specified minimum cost flow problem.MinimumCostFlowAlgorithm.MinimumCostFlow<E> Represents a minimum cost flow.MinimumSTCutAlgorithm<V,E> Given a weighted graph $G(V,E)$ (directed or undirected).MultiObjectiveShortestPathAlgorithm<V,E> An algorithm which computes multiobjective shortest paths between vertices.MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E> A set of paths starting from a single source vertex.PartitioningAlgorithm<V> Algorithm to compute a vertex partitioning of a graph.PartitioningAlgorithm.Partitioning<V> PlanarityTestingAlgorithm<V,E> Allows to check the planarity of the graph.PlanarityTestingAlgorithm.Embedding<V,E> A combinatorial embedding of the graph.ShortestPathAlgorithm<V,E> An algorithm which computes shortest paths between vertices.ShortestPathAlgorithm.SingleSourcePaths<V,E> A set of paths starting from a single source vertex.SpannerAlgorithm<E> An algorithm which computes a graph spanner of a given graph.SpannerAlgorithm.Spanner<E> A graph spanner.SpanningTreeAlgorithm<E> An algorithm which computes a spanning tree of a given connected graph.SpanningTreeAlgorithm.SpanningTree<E> A spanning tree.StrongConnectivityAlgorithm<V,E> A strong connectivity inspector algorithm.TreeToPathDecompositionAlgorithm<V,E> An algorithm which computes a decomposition into disjoint paths for a given tree/forestTreeToPathDecompositionAlgorithm.PathDecomposition<V,E> A path decomposition.VertexColoringAlgorithm<V> An algorithm which computes a graph vertex coloring.VertexColoringAlgorithm.Coloring<V> A coloring.VertexCoverAlgorithm<V> Computes a (weighted) vertex cover in an undirected graph.VertexCoverAlgorithm.VertexCover<V> VertexScoringAlgorithm<V,D> An interface for all algorithms which assign scores to vertices of a graph. 
Class Summary Class Description CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl<V,E> Default implementation of the spanning tree interface.CliqueAlgorithm.CliqueImpl<V> Default implementation of a (weighted) cliqueClusteringAlgorithm.ClusteringImpl<V> Default implementation of the clustering interface.CycleBasisAlgorithm.CycleBasisImpl<V,E> Default implementation of the undirected cycle basis interface.FlowAlgorithm.FlowImpl<E> Default implementation ofFlowAlgorithm.Flow
IndependentSetAlgorithm.IndependentSetImpl<V> Default implementation of a (weighted) independent setManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl<V,E> Base class for manytomany shortest paths implementations.MatchingAlgorithm.MatchingImpl<V,E> A default implementation of the matching interface.MaximumFlowAlgorithm.MaximumFlowImpl<E> Default implementation of the maximum flowMinimumCostFlowAlgorithm.MinimumCostFlowImpl<E> Default implementation of theMinimumCostFlowAlgorithm.MinimumCostFlow
PartitioningAlgorithm.PartitioningImpl<V> Default implementation of a vertex partitionPlanarityTestingAlgorithm.EmbeddingImpl<V,E> Implementation of thePlanarityTestingAlgorithm.Embedding
.SpannerAlgorithm.SpannerImpl<E> Default implementation of the spanner interface.SpanningTreeAlgorithm.SpanningTreeImpl<E> Default implementation of the spanning tree interface.TreeToPathDecompositionAlgorithm.PathDecompositionImpl<V,E> Default implementation of the path decomposition interface.VertexColoringAlgorithm.ColoringImpl<V> Default implementation of the coloring interface.VertexCoverAlgorithm.VertexCoverImpl<V> Default implementation of a (weighted) vertex cover