JGAlgo - Parent 0.5.1-SNAPSHOT API
| Package | Description |
|---|---|
| com.jgalgo |
Parent package for all modules of the JGAlgo library.
|
| com.jgalgo.adapt.guava |
Adapters from Guava to JGalgo, and from JGalgo to Guava.
|
| com.jgalgo.adapt.jgrapht |
Adapters from JGraphT to JGalgo, and from JGalgo to JGraphT.
|
| com.jgalgo.alg.bipartite |
Algorithms for solving bipartite graph problems.
|
| com.jgalgo.alg.clique |
Algorithms for solving cliques and independent sets problems.
|
| com.jgalgo.alg.closure |
Algorithms for findings closures in graphs.
|
| 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.dag |
Algorithms specifically designed for directed acyclic graphs (DAGs).
|
| com.jgalgo.alg.distancemeasures |
Algorithms for computing the distance measures properties in graphs, such as the the diameter, the radius, the
eccentricity, the center, ect.
|
| 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.isomorphism |
Algorithms for determining isomorphism between graphs.
|
| 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.
|
| com.jgalgo.alg.tree |
Algorithms specifically for tree graphs, such as LCA or TPM.
|
| com.jgalgo.example |
Simple examples using the basics of
com.jgalgo.graph and algorithms. |
| com.jgalgo.gen |
Graph generators used to generate (possibly random) graphs with different distributions and structures.
|
| com.jgalgo.graph |
Graphs object are the fundamental building blocks of the JGAlgo library.
|
| com.jgalgo.io |
The I/O classes provide varies ways to read/write graphs from/to files.
|