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.densesubgraph 
Algorithms for computing maximum density subgraphs.

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

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 

StrongConnectivityAlgorithm
A strong connectivity inspector algorithm.

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 

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.

Class and Description 

MaximumDensitySubgraphAlgorithm
Interface for algorithms computing the maximum density subgraph

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

Class and Description 

FlowAlgorithm
Interface for flow algorithms

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 

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.

Class and Description 

IndependentSetAlgorithm
Algorithm to compute an
Independent Set in a graph.

IndependentSetAlgorithm.IndependentSet
A (weighted) Independent
Set

Class and Description 

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

Class and Description 

MatchingAlgorithm
Allows to derive a matching of
a given graph.

MatchingAlgorithm.Matching
A graph matching.

Class and Description 

MatchingAlgorithm
Allows to derive a matching of
a given graph.

MatchingAlgorithm.Matching
A graph matching.

Class and Description 

PartitioningAlgorithm
Algorithm to compute a vertex partitioning of a graph.

PartitioningAlgorithm.Partitioning 
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 

CapacitatedSpanningTreeAlgorithm
An algorithm which computes a capacitated (minimum) spanning tree of a given connected graph with a designated root
vertex.

CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree
A spanning tree.

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.

Class and Description 

VertexCoverAlgorithm
Computes a (weighted) vertex cover in
an undirected graph.

VertexCoverAlgorithm.VertexCover 
Copyright © 2019. All rights reserved.