Package  Description 

org.jgrapht.alg 
Algorithms provided with JGraphT.

org.jgrapht.alg.cycle 
Algorithms for enumeration of simple cycles in graphs.

org.jgrapht.alg.flow 
Flow related algorithms.

org.jgrapht.alg.interfaces 
Algorithm related interfaces.

org.jgrapht.alg.matching 
Algorithms for the computation of matchings.

org.jgrapht.alg.scoring 
Vertex and/or edge scoring algorithms.

org.jgrapht.alg.shortestpath 
Shortestpath related algorithms.

org.jgrapht.alg.spanning 
Spanning tree and spanner algorithms.

org.jgrapht.alg.vertexcover 
Vertex cover algorithms.

Class and Description 

AStarAdmissibleHeuristic
Interface for an admissible heuristic used in A* search.

MatchingAlgorithm
Allows to derive a matching of
a given graph.

MatchingAlgorithm.Matching
A graph matching.

MinimumSpanningTree
Deprecated.
In favor of
SpanningTreeAlgorithm . 
StrongConnectivityAlgorithm
An interface to the StrongConnectivityInspector algorithm classes.

WeightedMatchingAlgorithm
Deprecated.
Use
MatchingAlgorithm directly 
Class and Description 

EulerianCycleAlgorithm
Computes an Eulerian cycle of an Eulerian graph.

Class and Description 

MaximumFlowAlgorithm
Allows to derive maximumflow
from the supplied flow network

MaximumFlowAlgorithm.MaximumFlow
A maximum flow

MinimumSTCutAlgorithm
Given a weighted graph G(V,E) (directed or undirected).

Class and Description 

MatchingAlgorithm
Allows to derive a matching of
a given graph.

MatchingAlgorithm.Matching
A graph matching.

MaximumFlowAlgorithm.MaximumFlow
A maximum flow

MinimumVertexCoverAlgorithm
Computes a vertex cover in an undirected graph.

MinimumVertexCoverAlgorithm.VertexCover
A vertex cover

ShortestPathAlgorithm.SingleSourcePaths
A set of paths starting from a single source vertex.

SpannerAlgorithm.Spanner
A graph spanner.

SpanningTreeAlgorithm.SpanningTree
A spanning tree.

Class and Description 

MatchingAlgorithm
Allows to derive a matching of
a given graph.

MatchingAlgorithm.Matching
A graph matching.

Class and Description 

VertexScoringAlgorithm
An interface for all algorithms which assign scores to vertices of a graph.

Class and Description 

AStarAdmissibleHeuristic
Interface for an admissible heuristic used in A* search.

KShortestPathAlgorithm
An algorithm which computes kshortest paths between vertices.

ShortestPathAlgorithm
An algorithm which computes shortest paths between vertices.

ShortestPathAlgorithm.SingleSourcePaths
A set of paths starting from a single source vertex.

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.

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.

Copyright © 2017. All rights reserved.