| 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.clustering |
Graph clustering 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.drawing |
Graph Drawing.
|
| org.jgrapht.alg.drawing.model |
Graph Drawing Basic Types and Models.
|
| 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.planar |
Algorithms for testing planarity of the graphs
|
| 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.util.extension |
Utility classes for managing extensions/encapsulations.
|
| org.jgrapht.alg.vertexcover |
Vertex cover algorithms.
|
| org.jgrapht.alg.vertexcover.util |
Utilities for vertex cover algorithms.
|
| org.jgrapht.demo |
Demo programs that help to get started with JGraphT.
|
| org.jgrapht.event |
Event classes and listener interfaces, used to provide a change notification mechanism on graph
modification events.
|
| 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 | |
| org.jgrapht.graph.specifics |
Implementations of specifics for various graph types.
|
| org.jgrapht.io |
Importers/Exporters for various graph formats.
|
| org.jgrapht.nio |
Importers/Exporters for various graph formats.
|
| org.jgrapht.nio.csv |
CSV importers/exporters
|
| org.jgrapht.nio.dimacs |
DIMACS Challenges importers/exporters
|
| org.jgrapht.nio.dot |
DOT importers/exporters
|
| org.jgrapht.nio.gml |
GML importers/exporters
|
| org.jgrapht.nio.graph6 |
Graph6, sparse6 and digraph6 importers/exporters
|
| org.jgrapht.nio.graphml |
GraphML importers/exporters
|
| org.jgrapht.nio.json |
Json importers/exporters
|
| org.jgrapht.nio.lemon |
Lemon input/output.
|
| org.jgrapht.nio.matrix |
Matrix input/output
|
| org.jgrapht.opt.graph.fastutil |
Specialized graph implementations using the FastUtil library
|
| org.jgrapht.opt.graph.sparse |
A specialized graph implementation using a sparse matrix representations.
|
| org.jgrapht.traverse |
Graph traversal means.
|
| org.jgrapht.util |
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
|