Uses of Package
org.jgrapht.alg.interfaces

Packages that use org.jgrapht.alg.interfaces

Package	Description
org.jgrapht.alg.clique	Clique related algorithms.
org.jgrapht.alg.color	Graph coloring algorithms.
org.jgrapht.alg.connectivity	Algorithms dealing with various connectivity aspects of a graph.
org.jgrapht.alg.cycle	Algorithms related to graph cycles.
org.jgrapht.alg.decomposition	Algorithms for computing decompositions.
org.jgrapht.alg.flow	Flow related algorithms.
org.jgrapht.alg.flow.mincost	Algorithms for minimum cost flow
org.jgrapht.alg.independentset	Algorithms for Independent Set in a graph.
org.jgrapht.alg.interfaces	Algorithm related interfaces.
org.jgrapht.alg.lca	Algorithms for computing lowest common ancestors in graphs.
org.jgrapht.alg.matching	Algorithms for the computation of matchings.
org.jgrapht.alg.matching.blossom.v5	Package for Kolmogorov's Blossom V algorithm
org.jgrapht.alg.partition	Algorithm for computing partitions.
org.jgrapht.alg.scoring	Vertex and/or edge scoring algorithms.
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.
org.jgrapht.alg.spanning	Spanning tree and spanner algorithms.
org.jgrapht.alg.tour	Graph tours related algorithms.
org.jgrapht.alg.vertexcover	Vertex cover algorithms.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.clique

Class and Description
CliqueAlgorithm Algorithm to compute a (weighted) Clique in a graph.
CliqueAlgorithm.Clique A Clique
MaximalCliqueEnumerationAlgorithm A maximal clique enumeration algorithm.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.color

Class and Description
VertexColoringAlgorithm An algorithm which computes a graph vertex coloring.
VertexColoringAlgorithm.Coloring A coloring.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.connectivity

Class and Description
StrongConnectivityAlgorithm A strong connectivity inspector algorithm.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.cycle

Class and Description
CycleBasisAlgorithm Allows to derive an undirected cycle basis of a given graph.
CycleBasisAlgorithm.CycleBasis An undirected cycle basis.
EulerianCycleAlgorithm Computes an Eulerian cycle of an Eulerian graph.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.decomposition

Class and Description
MatchingAlgorithm.Matching A graph matching.
TreeToPathDecompositionAlgorithm An algorithm which computes a decomposition into disjoint paths for a given tree/forest
TreeToPathDecompositionAlgorithm.PathDecomposition A path decomposition.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.flow

Class and Description
FlowAlgorithm Interface for flow algorithms
MaximumFlowAlgorithm Allows to derive maximum-flow from the supplied flow network
MaximumFlowAlgorithm.MaximumFlow A maximum flow
MinimumSTCutAlgorithm Given a weighted graph $G(V,E)$ (directed or undirected).

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.flow.mincost

Class and Description
FlowAlgorithm Interface for flow algorithms
MinimumCostFlowAlgorithm Allows to calculate minimum cost flow on the specified minimum cost flow problem.
MinimumCostFlowAlgorithm.MinimumCostFlow Represents a minimum cost flow.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.independentset

Class and Description
IndependentSetAlgorithm Algorithm to compute an Independent Set in a graph.
IndependentSetAlgorithm.IndependentSet A (weighted) Independent Set

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.interfaces

Class and Description
CliqueAlgorithm.Clique A Clique
CycleBasisAlgorithm.CycleBasis An undirected cycle basis.
FlowAlgorithm Interface for flow algorithms
FlowAlgorithm.Flow Represents a flow.
FlowAlgorithm.FlowImpl Default implementation of FlowAlgorithm.Flow
IndependentSetAlgorithm.IndependentSet A (weighted) Independent Set
MatchingAlgorithm.Matching A graph matching.
MaximumFlowAlgorithm.MaximumFlow A maximum flow
MinimumCostFlowAlgorithm.MinimumCostFlow Represents a minimum cost flow.
MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths A set of paths starting from a single source vertex.
PartitioningAlgorithm.Partitioning A graph partitioning.
ShortestPathAlgorithm.SingleSourcePaths A set of paths starting from a single source vertex.
SpannerAlgorithm.Spanner A graph spanner.
SpanningTreeAlgorithm.SpanningTree A spanning tree.
TreeToPathDecompositionAlgorithm.PathDecomposition A path decomposition.
VertexColoringAlgorithm.Coloring A coloring.
VertexCoverAlgorithm.VertexCover A Vertex Cover

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.lca

Class and Description
LowestCommonAncestorAlgorithm Algorithm to compute a lowest common ancestor in a tree, forest or DAG.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.matching

Class and Description
MatchingAlgorithm Allows to derive a matching of a given graph.
MatchingAlgorithm.Matching A graph matching.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.matching.blossom.v5

Class and Description
MatchingAlgorithm Allows to derive a matching of a given graph.
MatchingAlgorithm.Matching A graph matching.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.partition

Class and Description
PartitioningAlgorithm Algorithm to compute a vertex partitioning of a graph.
PartitioningAlgorithm.Partitioning A graph partitioning.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.scoring

Class and Description
ShortestPathAlgorithm An algorithm which computes shortest paths between vertices.
VertexScoringAlgorithm An interface for all algorithms which assign scores to vertices of a graph.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.shortestpath

Class and Description
AStarAdmissibleHeuristic Interface for an admissible heuristic used in A* search.
KShortestPathAlgorithm An algorithm which computes $k$-shortest paths between vertices.
MultiObjectiveShortestPathAlgorithm An algorithm which computes multi-objective shortest paths between vertices.
MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths A set of paths starting from a single source vertex.
ShortestPathAlgorithm An algorithm which computes shortest paths between vertices.
ShortestPathAlgorithm.SingleSourcePaths A set of paths starting from a single source vertex.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.spanning

Class and Description
SpannerAlgorithm An algorithm which computes a graph spanner of a given graph.
SpannerAlgorithm.Spanner A graph spanner.
SpanningTreeAlgorithm An algorithm which computes a spanning tree of a given connected graph.
SpanningTreeAlgorithm.SpanningTree A spanning tree.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.tour

Class and Description
HamiltonianCycleAlgorithm An algorithm solving the Hamiltonian cycle problem.

Classes in org.jgrapht.alg.interfaces used by org.jgrapht.alg.vertexcover

Class and Description
VertexCoverAlgorithm Computes a (weighted) vertex cover in an undirected graph.
VertexCoverAlgorithm.VertexCover A Vertex Cover