Uses of Package
com.jgalgo.alg.common

Packages that use com.jgalgo.alg.common
Package
Description
Algorithms for solving bipartite graph problems.
Algorithms for solving graph coloring problems.
Package for common classes and interfaces used by the algorithms in the JGAlgo library.
Algorithms for solving connectivity problems, such as strongly/weakly connected components, minimum edge/vertex cuts, ect.
Algorithms for computing the cores of graphs.
Algorithms for solving set cover problems, such as minimum vertex/edge cover, dominating set, etc.
Algorithms solving cycles related problems, such as iterating over cycles in a graph, findings a cycle with the minimum mean edge weight, etc.
Algorithms for finding Eulerian paths and cycles in graphs.
Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.
Algorithms for solving Hamiltonian path problems.
Algorithms for computing matchings in graphs, such as maximum/minimum weight matchings, maximum cardinality matchings, perfect matchings, ect.
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.
Algorithms for finding the minimum spanning trees and Steiner trees of graphs.
Algorithms for traversing graphs, such as depth-first search and breadth-first search.