Uses of Package
com.jgalgo.alg.common
-
Packages that use com.jgalgo.alg.common Package Description com.jgalgo.alg.bipartite Algorithms for solving bipartite graph problems.com.jgalgo.alg.color Algorithms for solving graph coloring problems.com.jgalgo.alg.common Package for common classes and interfaces used by the algorithms in the JGAlgo library.com.jgalgo.alg.connect Algorithms for solving connectivity problems, such as strongly/weakly connected components, minimum edge/vertex cuts, ect.com.jgalgo.alg.cores Algorithms for computing the cores of graphs.com.jgalgo.alg.cover Algorithms for solving set cover problems, such as minimum vertex/edge cover, dominating set, etc.com.jgalgo.alg.cycle Algorithms solving cycles related problems, such as iterating over cycles in a graph, findings a cycle with the minimum mean edge weight, etc.com.jgalgo.alg.euler Algorithms for finding Eulerian paths and cycles in graphs.com.jgalgo.alg.flow Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.com.jgalgo.alg.hamilton Algorithms for solving Hamiltonian path problems.com.jgalgo.alg.match Algorithms for computing matchings in graphs, such as maximum/minimum weight matchings, maximum cardinality matchings, perfect matchings, ect.com.jgalgo.alg.shortestpath Algorithms for finding paths in graphs, such as shortest paths, iterating over all simple paths between two vertices, computing the Voronoi cells given a set of sites, ect.com.jgalgo.alg.span Algorithms for finding the minimum spanning trees and Steiner trees of graphs.com.jgalgo.alg.traversal Algorithms for traversing graphs, such as depth-first search and breadth-first search. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.bipartite Class Description IVertexBiPartition A partition of the vertices of an int graph into two blocks.VertexBiPartition A partition of the vertices of a graph into two blocks. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.color Class Description RandomizedAlgorithm Randomized algorithm interface.VertexPartition A partition of the vertices of a graph. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.common Class Description EdgeDirection The direction type of an edge with respect to a vertex.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.Path A path of edges in a graph.VertexBiPartition A partition of the vertices of a graph into two blocks.VertexPartition A partition of the vertices of a graph. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.connect Class Description RandomizedAlgorithm Randomized algorithm interface.VertexBiPartition A partition of the vertices of a graph into two blocks.VertexPartition A partition of the vertices of a graph. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.cores Class Description EdgeDirection The direction type of an edge with respect to a vertex. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.cover Class Description EdgeDirection The direction type of an edge with respect to a vertex.RandomizedAlgorithm Randomized algorithm interface. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.cycle Class Description Path A path of edges in a graph. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.euler Class Description Path A path of edges in a graph. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.flow Class Description AlgorithmBuilderBase A base interface for all algorithm builders.IVertexBiPartition A partition of the vertices of an int graph into two blocks. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.hamilton Class Description Path A path of edges in a graph. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.match Class Description AlgorithmBuilderBase A base interface for all algorithm builders. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.shortestpath Class Description AlgorithmBuilderBase A base interface for all algorithm builders.IPath A path of edges in an int graph.IVertexPartition A partition of the vertices of an int graph.Path A path of edges in a graph.VertexPartition A partition of the vertices of a graph. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.span Class Description RandomizedAlgorithm Randomized algorithm interface. -
Classes in com.jgalgo.alg.common used by com.jgalgo.alg.traversal Class Description RandomizedAlgorithm Randomized algorithm interface.