Uses of Package
org.jgrapht.alg.interfaces

Packages that use org.jgrapht.alg.interfaces

Package	Description
org.jgrapht.alg	Algorithms provided with JGraphT.
org.jgrapht.alg.flow	Flow related algorithms.
org.jgrapht.alg.interfaces	Algorithm related interfaces.
org.jgrapht.alg.vertexcover	Vertex cover algorithms.

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

Class and Description
AStarAdmissibleHeuristic Interface for an admissible heuristic used in A* search.
MatchingAlgorithm Allows to derive matching from given graph
MaximumFlowAlgorithm Allows to derive maximum-flow from the supplied flow network
MinimumSpanningTree Allows to derive minimum spanning tree from given undirected connected graph.
StrongConnectivityAlgorithm An interface to the StrongConnectivityInspector algorithm classes.
WeightedMatchingAlgorithm Allows to derive weighted matching from general graph

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

Class and Description
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.interfaces

Class and Description
MatchingAlgorithm Allows to derive matching from given graph
MaximumFlowAlgorithm.MaximumFlow A maximum flow
MinimumVertexCoverAlgorithm Computes a vertex cover in an undirected graph.
MinimumVertexCoverAlgorithm.VertexCover A vertex cover

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

Class and Description
MinimumVertexCoverAlgorithm Computes a vertex cover in an undirected graph.
MinimumVertexCoverAlgorithm.VertexCover A vertex cover
MinimumWeightedVertexCoverAlgorithm Computes a weighted vertex cover in an undirected graph.