Package | Description |
---|---|
org.jgrapht |
The front-end API's interfaces and classes, including
Graph . |
org.jgrapht.alg |
Algorithms provided with JGraphT.
|
org.jgrapht.alg.clique |
Clique related algorithms.
|
org.jgrapht.alg.color |
Graph coloring algorithms.
|
org.jgrapht.alg.connectivity |
Algorithms dealing with various connectivity aspects of a graph.
|
org.jgrapht.alg.cycle |
Algorithms related to graph cycles.
|
org.jgrapht.alg.decomposition |
Algorithms for computing decompositions.
|
org.jgrapht.alg.densesubgraph |
Algorithms for computing maximum density subgraphs.
|
org.jgrapht.alg.flow |
Flow related algorithms.
|
org.jgrapht.alg.flow.mincost |
Algorithms for minimum cost flow
|
org.jgrapht.alg.independentset |
Algorithms for Independent
Set in a graph.
|
org.jgrapht.alg.interfaces |
Algorithm related interfaces.
|
org.jgrapht.alg.isomorphism |
Algorithms for (sub)graph isomorphism.
|
org.jgrapht.alg.lca |
Algorithms for computing lowest common ancestors in graphs.
|
org.jgrapht.alg.matching |
Algorithms for the computation of matchings.
|
org.jgrapht.alg.matching.blossom.v5 |
Package for Kolmogorov's Blossom V algorithm
|
org.jgrapht.alg.partition |
Algorithm for computing partitions.
|
org.jgrapht.alg.scoring |
Vertex and/or edge scoring algorithms.
|
org.jgrapht.alg.shortestpath |
Shortest-path related algorithms.
|
org.jgrapht.alg.spanning |
Spanning tree and spanner algorithms.
|
org.jgrapht.alg.tour |
Graph tours related algorithms.
|
org.jgrapht.alg.transform |
Package for graph transformers
|
org.jgrapht.alg.util |
Utilities used by JGraphT algorithms.
|
org.jgrapht.alg.vertexcover |
Vertex cover algorithms.
|
org.jgrapht.ext |
Extensions and integration means to other products.
|
org.jgrapht.generate |
Generators for graphs of various topologies.
|
org.jgrapht.graph |
Implementations of various graphs.
|
org.jgrapht.graph.builder |
Various builder for graphs.
|
org.jgrapht.graph.concurrent |
Implementations of various concurrent graph structures.
|
org.jgrapht.graph.guava |
Guava adapters.
|
org.jgrapht.graph.specifics |
Implementations of specifics for various graph types.
|
org.jgrapht.io |
Importers/Exporters for various graph formats.
|
org.jgrapht.opt.graph.fastutil |
Specialized graph implementations using the FastUtil library
|
org.jgrapht.traverse |
Graph traversal means.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphType
A graph type.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphPath |
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphPath |
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphMapping
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.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphPath |
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphPath |
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
ListenableGraph
A graph that supports listeners on structural change events.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphMapping
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.
|
GraphPath |
GraphType
A graph type.
|
ListenableGraph
A graph that supports listeners on structural change events.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphType
A graph type.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphType
A graph type.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
GraphType
A graph type.
|
Class and Description |
---|
Graph
The root interface in the graph hierarchy.
|
Copyright © 2019. All rights reserved.