Uses of Package
org.jgrapht
Packages that use org.jgrapht
Package
Description
The front-end API's interfaces and classes, including
Graph.Algorithms provided with JGraphT.
Center location algorithms in graphs.
Clique related algorithms.
Graph clustering algorithms.
Graph coloring algorithms.
Algorithms dealing with various connectivity aspects of a graph.
Algorithms related to graph cycles.
Algorithms for computing decompositions.
Algorithms for computing maximum density subgraphs.
Graph Drawing.
Flow related algorithms.
Algorithms for minimum cost flow
Algorithms for Independent
Set in a graph.
Algorithm related interfaces.
Algorithms for (sub)graph isomorphism.
Algorithms for computing lowest common ancestors in graphs.
Algorithms for link prediction
Algorithms for the computation of matchings.
Package for Kolmogorov's Blossom V algorithm
Algorithm for computing partitions.
Algorithms for testing planarity of the graphs
Vertex and/or edge scoring algorithms.
Shortest-path related algorithms.
Algorithms for computing graph similarity metrics.
Spanning tree and spanner algorithms.
Steiner tree related algorithms.
Graph tours related algorithms.
Package for graph transformers
Utilities used by JGraphT algorithms.
Vertex cover algorithms.
Generators for graphs of various topologies.
Network generator components
Implementations of various graphs.
Various builder for graphs.
Implementations of various concurrent graph structures.
Implementations of specifics for various graph types.
Graph traversal means.
-
Classes in org.jgrapht used by org.jgraphtClassDescriptionThe root interface in the graph hierarchy.Presents a graph as a collection of views suitable for graphs which contain a very large number of vertices or edges.A graph type.
-
Classes in org.jgrapht used by org.jgrapht.alg
-
Classes in org.jgrapht used by org.jgrapht.alg.centers
-
Classes in org.jgrapht used by org.jgrapht.alg.clique
-
Classes in org.jgrapht used by org.jgrapht.alg.clustering
-
Classes in org.jgrapht used by org.jgrapht.alg.color
-
Classes in org.jgrapht used by org.jgrapht.alg.connectivity
-
Classes in org.jgrapht used by org.jgrapht.alg.cycle
-
Classes in org.jgrapht used by org.jgrapht.alg.decomposition
-
Classes in org.jgrapht used by org.jgrapht.alg.densesubgraph
-
Classes in org.jgrapht used by org.jgrapht.alg.drawing
-
Classes in org.jgrapht used by org.jgrapht.alg.flow
-
Classes in org.jgrapht used by org.jgrapht.alg.flow.mincost
-
Classes in org.jgrapht used by org.jgrapht.alg.independentset
-
Classes in org.jgrapht used by org.jgrapht.alg.interfaces
-
Classes in org.jgrapht used by org.jgrapht.alg.isomorphismClassDescriptionThe root interface in the graph hierarchy.GraphMapping represents a bidirectional mapping between two graphs (called graph1 and graph2), which allows the caller to obtain the matching vertex or edge in either direction, from graph1 to graph2, or from graph2 to graph1.
-
Classes in org.jgrapht used by org.jgrapht.alg.lca
-
Classes in org.jgrapht used by org.jgrapht.alg.linkprediction
-
Classes in org.jgrapht used by org.jgrapht.alg.matching
-
Classes in org.jgrapht used by org.jgrapht.alg.matching.blossom.v5
-
Classes in org.jgrapht used by org.jgrapht.alg.partition
-
Classes in org.jgrapht used by org.jgrapht.alg.planar
-
Classes in org.jgrapht used by org.jgrapht.alg.scoring
-
Classes in org.jgrapht used by org.jgrapht.alg.shortestpath
-
Classes in org.jgrapht used by org.jgrapht.alg.similarity
-
Classes in org.jgrapht used by org.jgrapht.alg.spanning
-
Classes in org.jgrapht used by org.jgrapht.alg.steiner
-
Classes in org.jgrapht used by org.jgrapht.alg.tour
-
Classes in org.jgrapht used by org.jgrapht.alg.transform
-
Classes in org.jgrapht used by org.jgrapht.alg.util
-
Classes in org.jgrapht used by org.jgrapht.alg.vertexcover
-
Classes in org.jgrapht used by org.jgrapht.generate
-
Classes in org.jgrapht used by org.jgrapht.generate.netgen
-
Classes in org.jgrapht used by org.jgrapht.graphClassDescriptionThe root interface in the graph hierarchy.Presents a graph as a collection of views suitable for graphs which contain a very large number of vertices or edges.GraphMapping represents a bidirectional mapping between two graphs (called graph1 and graph2), which allows the caller to obtain the matching vertex or edge in either direction, from graph1 to graph2, or from graph2 to graph1.A graph type.A graph that supports listeners on structural change events.
-
Classes in org.jgrapht used by org.jgrapht.graph.builder
-
Classes in org.jgrapht used by org.jgrapht.graph.concurrent
-
Classes in org.jgrapht used by org.jgrapht.graph.specifics
-
Classes in org.jgrapht used by org.jgrapht.traverse