Uses of Package
com.jgalgo.alg

Packages that use com.jgalgo.alg

Package	Description
com.jgalgo.alg	Algorithms for solving graph problems.

Classes in com.jgalgo.alg used by com.jgalgo.alg

Class	Description
AlgorithmBuilderBase	A base interface for all algorithm builders.
Bfs.IntIter	A BFS iterator for IntGraph.
Bfs.Iter	A 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.
ChinesePostman	An algorithm for the chinese postman problem.
ChinesePostman.Builder	A builder for ChinesePostman objects.
ClosuresEnumerator	An algorithm that enumerate all the closure subsets in a directed graph.
ClosuresEnumerator.Builder	A builder for ClosuresEnumerator objects.
ColoringAlgo	An algorithm that assign a color to each vertex in a graph while avoiding identical color for any pair of adjacent vertices.
ColoringAlgo.Builder	A builder for ColoringAlgo objects.
CoresAlgo	Cores computing algorithm.
CoresAlgo.Builder	A builder for CoresAlgo objects.
CoresAlgo.Result	The result of the cores computation.
CyclesEnumerator	An algorithm that enumerate all cycles in a graph.
CyclesEnumerator.Builder	A builder for CyclesEnumerator objects.
Dfs.IntIter	A DFS iterator for IntGraph.
Dfs.Iter	A DFS iterator.
DominatingSetAlgo	An algorithm for computing a minimum dominating set.
DominatingSetAlgo.Builder	A builder for DominatingSetAlgo algorithms.
EdgeCover	Minimum edge vertex cover algorithm.
EdgeCover.Builder	A builder for EdgeCover algorithms.
EdgeDirection	The direction type of an edge with respect to a vertex.
EulerianTourAlgo	Eulerian tour calculation algorithm.
EulerianTourAlgo.Builder	A builder for EulerianTourAlgo objects.
Flow	Flow on graph edges.
IPath	A path of edges in an int graph.
IVertexBiPartition	A partition of the vertices of an int graph into two blocks.
IVertexPartition	A partition of the vertices of an int graph.
KEdgeConnectedComponentsAlgo	An algorithm that compute the k-edge connected components of a graph.
KEdgeConnectedComponentsAlgo.Builder	A builder for KEdgeConnectedComponentsAlgo objects.
KShortestPathsST	An algorithm for computing the K shortest paths between two vertices in a graph.
KShortestPathsST.Builder	A builder for KShortestPathsST objects.
KVertexConnectedComponentsAlgo	Finds the k-vertex connected components of a graph.
KVertexConnectedComponentsAlgo.Builder	A builder for KVertexConnectedComponentsAlgo objects.
KVertexConnectedComponentsAlgo.Result	Result of a KVertexConnectedComponentsAlgo computation.
LowestCommonAncestorDynamic	Dynamic algorithm for Lowest Common Ancestor (LCA) queries.
LowestCommonAncestorDynamic.Builder	A builder for LowestCommonAncestorDynamic objects.
LowestCommonAncestorDynamic.Vertex	A tree vertex in an LowestCommonAncestorDynamic data structure.
LowestCommonAncestorOffline	An algorithm for computing the lowest common ancestor (LCA) of two vertices in a tree, offline.
LowestCommonAncestorOffline.Builder	A builder for LowestCommonAncestorOffline objects.
LowestCommonAncestorOffline.IQueries	Queries container for LowestCommonAncestorOffline computations for IntGraph.
LowestCommonAncestorOffline.Queries	Queries container for LowestCommonAncestorOffline computations.
LowestCommonAncestorOffline.Result	Result of a LowestCommonAncestorOffline computation.
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.
MatchingAlgo	Maximum/minimum matching algorithm.
MatchingAlgo.Builder	A builder for MatchingAlgo objects.
MaximalCliquesEnumerator	Algorithm for enumerating over all maximal cliques in a graph.
MaximalCliquesEnumerator.Builder	A builder for MaximalCliquesEnumerator objects.
MaximumFlow	Calculate the maximum flow in a flow network.
MaximumFlow.Builder	A builder for MaximumFlow objects.
MinimumCostFlow	Compute the minimum-cost (max) flow in a flow network.
MinimumCostFlow.Builder	A builder for MinimumCostFlow objects.
MinimumDirectedSpanningTree	Minimum spanning tree algorithm for directed graphs.
MinimumDirectedSpanningTree.Builder	A builder for MinimumDirectedSpanningTree objects.
MinimumEdgeCutAllST	Minimum Edge-Cut algorithm that finds all minimum edge-cuts in a graph between two terminal vertices (source-sink, S-T).
MinimumEdgeCutAllST.Builder	A builder for MinimumEdgeCutAllST objects.
MinimumEdgeCutGlobal	Global Minimum Edge-Cut algorithm without terminal vertices.
MinimumEdgeCutGlobal.Builder	A builder for MinimumEdgeCutGlobal objects.
MinimumEdgeCutST	Minimum Edge-Cut algorithm with terminal vertices (source-sink, S-T).
MinimumEdgeCutST.Builder	A builder for MinimumEdgeCutST 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.
MinimumVertexCutAllGlobal	Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph (global vertex-cut).
MinimumVertexCutAllGlobal.Builder	A builder for MinimumVertexCutAllGlobal objects.
MinimumVertexCutAllST	Minimum Vertex-Cut algorithm that finds all minimum vertex-cuts in a graph between two terminal vertices (source-sink, S-T).
MinimumVertexCutAllST.Builder	A builder for MinimumVertexCutAllST objects.
MinimumVertexCutGlobal	Minimum Vertex-Cut algorithm without terminal vertices.
MinimumVertexCutGlobal.Builder	A builder for MinimumVertexCutGlobal objects.
MinimumVertexCutST	Minimum Vertex-Cut algorithm with terminal vertices (source-sink, S-T).
MinimumVertexCutST.Builder	A builder for MinimumVertexCutST objects.
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.
ShortestPathHeuristicST	Shortest path algorithm that uses a distance heuristic function.
ShortestPathHeuristicST.Builder	A builder for ShortestPathHeuristicST objects.
ShortestPathSingleSource	Single Source Shortest Path algorithm.
ShortestPathSingleSource.Builder	A builder for ShortestPathSingleSource objects.
ShortestPathSingleSource.Result	A result object for the ShortestPathSingleSource problem.
ShortestPathST	An algorithm for computing the shortest path between two vertices in a graph.
ShortestPathST.Builder	A builder for ShortestPathST objects.
SimplePathsEnumerator	An algorithm that enumerate over simple paths between a source and a target.
SimplePathsEnumerator.Builder	A builder for SimplePathsEnumerator objects.
SteinerTreeAlgo	An algorithm for the Steiner tree problem.
SteinerTreeAlgo.Builder	A builder for SteinerTreeAlgo objects.
SteinerTreeAlgo.Result	A result object for SteinerTreeAlgo computation.
StronglyConnectedComponentsAlgo	Strongly Connected components algorithm.
StronglyConnectedComponentsAlgo.Builder	A builder for StronglyConnectedComponentsAlgo 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.IQueries	Queries container for TreePathMaxima computations for IntGraph.
TreePathMaxima.Queries	Queries container for TreePathMaxima computations.
TreePathMaxima.Result	A result object for TreePathMaxima algorithm.
TspMetric	Metric Traveling Salesman Problem (TSP) algorithm.
VertexBiPartition	A partition of the vertices of a graph into two blocks.
VertexCover	Minimum weighted vertex cover algorithm.
VertexCover.Builder	A builder for VertexCover algorithms.
VertexPartition	A partition of the vertices of a graph.
VoronoiAlgo	Voronoi cells algorithm.
VoronoiAlgo.Builder	A builder for VoronoiAlgo algorithms.
VoronoiAlgo.Result	A result object of VoronoiAlgo computation.
WeaklyConnectedComponentsAlgo	Weakly Connected components algorithm.
WeaklyConnectedComponentsAlgo.Builder	A builder for WeaklyConnectedComponentsAlgo objects.