Package com.jgalgo

Interface Summary

Interface	Description
BFSIter	Bread first search (BFS) iterator.
BiConnectedComponentsAlgo	An algorithm that compute the bi-connected components of a graph.
BiConnectedComponentsAlgo.Builder	A builder for BiConnectedComponentsAlgo objects.
BiConnectedComponentsAlgo.Result	A result object of a BiConnectedComponentsAlgo computation.
Coloring	An algorithm that assign a color to each vertex in a graph while avoiding identical color for any pair of adjacent vertices.
Coloring.Builder	A builder for Coloring objects.
Coloring.Result	A coloring result containing a color for each vertex.
ConnectedComponentsAlgo	Connectivity components algorithm.
ConnectedComponentsAlgo.Builder	A builder for ConnectedComponentsAlgo objects.
ConnectedComponentsAlgo.Result	Result object for connectivity components calculation.
Cut	A cut that partition the vertices of a graph into two sets.
CyclesFinder	An algorithm that finds all cycles in a graph.
CyclesFinder.Builder	A builder for CyclesFinder objects.
DFSIter	Depth first search (DFS) iterator.
EdgeIter	Iterator used to iterate over edges of a vertex.
EdgeSet	Set of graph edges.
EulerianTourAlgo	Eulerian tour calculation algorithm.
EulerianTourAlgo.Builder	A builder for EulerianTourAlgo objects.
FlowNetwork	Flow on graph edges, with capacities and flows values.
FlowNetwork.Int	Flow on graph edges, with integer capacities and flows values.
Graph	A discrete graph with vertices and edges.
Graph.Builder	A builder for Graph objects.
GraphCapabilities	Object specifying the capabilities of a graph implementation.
IndexGraph	A graph whose vertices and edges identifiers are indices.
IndexGraph.Builder	A builder for IndexGraph objects.
IndexIdMap	A mapping between Graph IDs to IndexGraph indices.
IndexSwapListener	A listener that will be notified when a IndexGraph chooses to swap two IDs (vertices/edges).
LowestCommonAncestorDynamic	Dynamic algorithm for Lowest Common Ancestor (LCA) queries.
LowestCommonAncestorDynamic.Builder	A builder for LowestCommonAncestorDynamic objects.
LowestCommonAncestorDynamic.Node	A tree node in an LowestCommonAncestorDynamic data structure.
LowestCommonAncestorStatic	Static Lowest Common Ancestor (LCA) algorithm.
LowestCommonAncestorStatic.Builder	A builder for LowestCommonAncestorStatic objects.
LowestCommonAncestorStatic.DataStructure	Data structure result created from a static LCA pre-processing.
Matching	A matching in a graph.
MaximumFlow	Calculate the maximum flow in a flow network.
MaximumFlow.Builder	A builder for MaximumFlow objects.
MaximumMatching	Maximum matching algorithm.
MaximumMatching.Builder	A builder for MaximumMatching objects.
MinimumCutGlobal	Global Minimum Cut algorithm without terminal vertices.
MinimumCutGlobal.Builder	A builder for MinimumCutGlobal objects.
MinimumCutST	Minimum Cut algorithm with terminal vertices (source-sink, S-T).
MinimumCutST.Builder	A builder for MinimumCutST objects.
MinimumDirectedSpanningTree	Minimum spanning tree algorithm for directed graphs.
MinimumDirectedSpanningTree.Builder	A builder for MinimumDirectedSpanningTree objects.
MinimumMeanCycle	Algorithm that find the cycle with the minimum mean weight.
MinimumMeanCycle.Builder	A builder for MinimumMeanCycle objects.
MinimumSpanningTree	Minimum spanning tree algorithm.
MinimumSpanningTree.Builder	A builder for MinimumSpanningTree objects.
MinimumSpanningTree.Result	A result object for MinimumSpanningTree computation.
Path	A path of edges in a graph.
ShortestPathAllPairs	An algorithm that compute all pairs shortest path (APSP) in a graph.
ShortestPathAllPairs.Builder	A builder for ShortestPathAllPairs objects.
ShortestPathAllPairs.Result	A result object for an ShortestPathAllPairs algorithm.
ShortestPathSingleSource	Single Source Shortest Path algorithm.
ShortestPathSingleSource.Builder	A builder for ShortestPathSingleSource objects.
ShortestPathSingleSource.Result	A result object for the ShortestPathSingleSource problem.
ShortestPathWithHeuristic	Shortest path algorithm that uses a distance heuristic function.
ShortestPathWithHeuristic.Builder	A builder for ShortestPathWithHeuristic objects.
TopologicalOrderAlgo	Algorithm that calculate a topological order of graph vertices.
TopologicalOrderAlgo.Builder	A builder for TopologicalOrderAlgo objects.
TopologicalOrderAlgo.Result	A result object of a TopologicalOrderAlgo algorithm.
TreePathMaxima	Tree Path Maxima (TPM) algorithm.
TreePathMaxima.Builder	A builder for TreePathMaxima objects.
TreePathMaxima.Queries	Queries container for TreePathMaxima computations.
TreePathMaxima.Result	A result object for TreePathMaxima algorithm.
TSPMetric	Metric Traveling Salesman Problem (TSP) algorithm.
VertexCover	Minimum weighted vertex cover algorithm.
VertexCover.Builder	A builder for VertexCover algorithms.
VertexCover.Result	A result object of VertexCover computation.
WeightFunction	Weight function that maps graph edges (or vertices) to weights.
WeightFunction.Int	Weight function that maps graph edges (or vertices) to integer weights.
Weights<W>	Weights of graph vertices or edges.
Weights.Bool	Specific weights of primitive type boolean.
Weights.Byte	Specific weights of primitive type byte.
Weights.Char	Specific weights of primitive type char.
Weights.Double	Specific weights of primitive type double.
Weights.Float	Specific weights of primitive type float.
Weights.Int	Specific weights of primitive type int.
Weights.Long	Specific weights of primitive type long.
Weights.Short	Specific weights of primitive type short.

Class Summary

Class	Description
Graphs	Static methods class for graphs.
JGAlgoConfig	A global configuration class.
Trees	Static methods class for tree graphs.
TSPMetricMatchingAppx	TSP \(3/2\)-approximation using maximum matching.
TSPMetricMSTAppx	TSP \(2\)-approximation using MST.

Enum Summary

Enum	Description
Graph.Builder.Hint	Hints for a graph builder.