All Packages
Package Summary
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.
Graph Drawing Basic Types and Models.
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.
Utility classes for managing extensions/encapsulations.
Vertex cover algorithms.
Utilities for vertex cover algorithms.
Event classes and listener interfaces, used to provide a change notification mechanism on graph
modification events.
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.
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.