Uses of Package
com.jgalgo.graph
Packages that use com.jgalgo.graph
Package
Description
Adapters from Guava to JGalgo, and from JGalgo to Guava.
Adapters from JGraphT to JGalgo, and from JGalgo to JGraphT.
Algorithms for solving bipartite graph problems.
Algorithms for solving cliques and independent sets problems.
Algorithms for findings closures in graphs.
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 specifically designed for directed acyclic graphs (DAGs).
Algorithms for computing the distance measures properties in graphs, such as the the diameter, the radius, the
eccentricity, the center, ect.
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 determining isomorphism between graphs.
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.
Algorithms specifically for tree graphs, such as LCA or TPM.
Graph generators used to generate (possibly random) graphs with different distributions and structures.
Graphs object are the fundamental building blocks of the JGAlgo library.
The I/O classes provide varies ways to read/write graphs from/to files.
-
Classes in com.jgalgo.graph used by com.jgalgo.adapt.guavaClassDescriptionAbstract implementation of
Graph.Set of graph edges.A discrete graph with vertices and edges.Builder for unique identifiers of vertices or edges in a graph.A graph whose vertices and edges identifiers are indices.A mapping betweenGraphIDs toIndexGraphindices.Weights of graph vertices or edges. -
Classes in com.jgalgo.graph used by com.jgalgo.adapt.jgraphtClassDescriptionAbstract implementation of
Graph.Set of graph edges.A discrete graph with vertices and edges.Builder for unique identifiers of vertices or edges in a graph.A graph whose vertices and edges identifiers are indices.A mapping betweenGraphIDs toIndexGraphindices.Weights of graph vertices or edges. -
Classes in com.jgalgo.graph used by com.jgalgo.alg.bipartite
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.clique
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.closure
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.color
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.commonClassDescriptionIterator used to iterate over graph edges.A discrete graph with vertices and edges.Iterator used to iterate over int graph edges.A graph whose vertices and edges identifiers are indices.A discrete graph with
intvertices and edges.Specific weights ofbooleanfor int graphs.Specific weights ofboolean. -
Classes in com.jgalgo.graph used by com.jgalgo.alg.connectClassDescriptionA discrete graph with vertices and edges.A discrete graph with
intvertices and edges.Weight function that maps graph edges or vertices to weights. -
Classes in com.jgalgo.graph used by com.jgalgo.alg.cores
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.coverClassDescriptionA discrete graph with vertices and edges.Weight function that maps graph edges or vertices to weights.
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.cycleClassDescriptionA discrete graph with vertices and edges.Weight function that maps graph edges or vertices to weights.
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.dag
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.distancemeasuresClassDescriptionA discrete graph with vertices and edges.Weight function that maps graph edges or vertices to weights.
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.euler
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.flowClassDescriptionA discrete graph with vertices and edges.A graph whose vertices and edges identifiers are indices.Weight function that maps graph edges or vertices of
IntGraphto weights.Weight function that maps graph edges or vertices to weights. -
Classes in com.jgalgo.graph used by com.jgalgo.alg.hamilton
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.isomorphism
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.matchClassDescriptionA discrete graph with vertices and edges.Weight function that maps graph edges or vertices to weights.
-
Classes in com.jgalgo.graph used by com.jgalgo.alg.shortestpathClassDescriptionA discrete graph with vertices and edges.A discrete graph with
intvertices and edges.Weight function that maps graph edges or vertices ofIntGraphto weights.Weight function that maps graph edges or vertices to weights. -
Classes in com.jgalgo.graph used by com.jgalgo.alg.spanClassDescriptionA discrete graph with vertices and edges.A graph whose vertices and edges identifiers are indices.Weight function that maps graph edges or vertices of
IntGraphto weights.Weight function that maps graph edges or vertices to weights. -
Classes in com.jgalgo.graph used by com.jgalgo.alg.traversalClassDescriptionA discrete graph with vertices and edges.A discrete graph with
intvertices and edges.Weight function that maps graph edges or vertices to weights. -
Classes in com.jgalgo.graph used by com.jgalgo.alg.treeClassDescriptionA discrete graph with vertices and edges.A discrete graph with
intvertices and edges.Weight function that maps graph edges or vertices to weights. -
Classes in com.jgalgo.graph used by com.jgalgo.gen
-
Classes in com.jgalgo.graph used by com.jgalgo.graphClassDescriptionIterator used to iterate over graph edges.Set of graph edges.A discrete graph with vertices and edges.A builder for graphs.A factory for
Graphobjects.Hints for a graph factory.Builder for unique identifiers of vertices or edges in a graph.Builder for unique identifiers of vertices or edges in anIntGraph.Iterator used to iterate over int graph edges.Set of int graph edges.A graph whose vertices and edges identifiers are indices.A builder for Index graphs.A result object of re-indexing and building a graph operation.A map of indices in range \([0, n)\) to indices in range \([0, n)\).A factory for Index graphs.A mapping betweenGraphIDs toIndexGraphindices.A mapping betweenIntGraphIDs toIndexGraphindices.A listener that will be notified when anIndexGraphremove a vertex or an edge.A discrete graph withintvertices and edges.A builder for int graphs.A factory forIntGraphobjects.Weight function that maps graph edges or vertices ofIntGraphto weights.Weight function that maps graph edges or vertices ofIntGraphto integer weights.Weights of int graph vertices or edges.Exception thrown when an edge is not found in a graph.Exception thrown when a vertex is not found in a graph.Weight function that maps graph edges or vertices to weights.Weight function that maps graph edges or vertices to integer weights.Weights of graph vertices or edges.Specific weights ofboolean.Specific weights ofbyte.Specific weights ofchar.Specific weights ofdouble.Specific weights offloat.Specific weights ofint.Specific weights oflong.Specific weights ofObject.Specific weights ofshort. -
Classes in com.jgalgo.graph used by com.jgalgo.ioClassDescriptionA discrete graph with vertices and edges.A builder for graphs.Builder for unique identifiers of vertices or edges in a graph.