Package  Description 

org.jgrapht.alg 
Algorithms provided with JGraphT.

org.jgrapht.alg.clique 
Clique related algorithms.

org.jgrapht.alg.color 
Graph coloring algorithms.

org.jgrapht.alg.cycle 
Algorithms related to graph cycles.

org.jgrapht.alg.flow 
Flow related algorithms.

org.jgrapht.alg.independentset 
Algorithms for Independent
Set in a graph.

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.tour 
Graph tours related algorithms.

org.jgrapht.alg.vertexcover 
Vertex cover algorithms.

Class and Description 

StrongConnectivityAlgorithm
A strong connectivity inspector algorithm.

Class and Description 

CliqueAlgorithm
Algorithm to compute a (weighted) Clique
in a graph.

CliqueAlgorithm.Clique
A Clique

MaximalCliqueEnumerationAlgorithm
A maximal clique enumeration algorithm.

Class and Description 

VertexColoringAlgorithm
An algorithm which computes a graph vertex coloring.

VertexColoringAlgorithm.Coloring
A coloring.

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.

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 

IndependentSetAlgorithm
Algorithm to compute an
Independent Set in a graph.

IndependentSetAlgorithm.IndependentSet
A (weighted) Independent
Set

Class and Description 

CliqueAlgorithm.Clique
A Clique

CycleBasisAlgorithm.CycleBasis
An undirected cycle basis.

HamiltonianCycleAlgorithm
An algorithm solving the Hamiltonian
cycle problem.

IndependentSetAlgorithm.IndependentSet
A (weighted) Independent
Set

MatchingAlgorithm.Matching
A graph matching.

MaximumFlowAlgorithm.MaximumFlow
A maximum flow

MinimumVertexCoverAlgorithm
Deprecated.
replaced by
VertexCoverAlgorithm 
MinimumVertexCoverAlgorithm.VertexCover
Deprecated.
Replaced by
VertexCoverAlgorithm.VertexCover 
MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths
A set of paths starting from a single source vertex.

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

SpannerAlgorithm.Spanner
A graph spanner.

SpanningTreeAlgorithm.SpanningTree
A spanning tree.

VertexColoringAlgorithm.Coloring
A coloring.

VertexCoverAlgorithm.VertexCover 
Class and Description 

MatchingAlgorithm
Allows to derive a matching of
a given graph.

MatchingAlgorithm.Matching
A graph matching.

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.

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 multiobjective 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.

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 

HamiltonianCycleAlgorithm
An algorithm solving the Hamiltonian
cycle problem.

TSPAlgorithm
Deprecated.
interface replaced by
HamiltonianCycleAlgorithm 
Class and Description 

MinimumVertexCoverAlgorithm
Deprecated.
replaced by
VertexCoverAlgorithm 
MinimumVertexCoverAlgorithm.VertexCover
Deprecated.
Replaced by
VertexCoverAlgorithm.VertexCover 
MinimumWeightedVertexCoverAlgorithm
Deprecated.
replaced by
VertexCoverAlgorithm 
VertexCoverAlgorithm
Computes a (weighted) vertex cover in
an undirected graph.

VertexCoverAlgorithm.VertexCover 
Copyright © 2018. All rights reserved.