Package | Description |
---|---|
org.jgrapht.alg |
Algorithms provided with JGraphT.
|
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.densesubgraph |
Algorithms for computing maximum density subgraphs.
|
org.jgrapht.alg.flow |
Flow related algorithms.
|
org.jgrapht.alg.interfaces |
Algorithm related interfaces.
|
org.jgrapht.generate |
Generators for graphs of various topologies.
|
org.jgrapht.graph |
Implementations of various 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.opt.graph.fastutil |
Specialized graph implementations using the FastUtil library
|
org.jgrapht.util |
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
|
Class and Description |
---|
DirectedAcyclicGraph
A directed acyclic graph (DAG).
|
SimpleDirectedGraph
A simple directed graph.
|
Class and Description |
---|
AbstractBaseGraph
The most general implementation of the
Graph interface. |
AbstractGraph
A skeletal implementation of the Graph interface, to minimize the effort required to
implement graph interfaces.
|
SimpleGraph
Implementation of a Simple Graph.
|
Class and Description |
---|
GraphWalk
A walk in a graph is an alternating sequence of vertices and edges, starting and ending at a
vertex, in which each edge is adjacent in the sequence to its two endpoints.
|
Class and Description |
---|
DefaultWeightedEdge
A default implementation for edges in a weighted graph.
|
Class and Description |
---|
DefaultWeightedEdge
A default implementation for edges in a weighted graph.
|
SimpleWeightedGraph
A simple weighted graph.
|
Class and Description |
---|
DefaultEdge
A default implementation for edges in a
Graph . |
Class and Description |
---|
DefaultEdge
A default implementation for edges in a
Graph . |
Class and Description |
---|
AbstractBaseGraph
The most general implementation of the
Graph interface. |
AbstractGraph
A skeletal implementation of the Graph interface, to minimize the effort required to
implement graph interfaces.
|
BaseIntrusiveEdgesSpecifics
A base implementation for the intrusive edges specifics.
|
DefaultDirectedGraph
The default implementation of a directed graph.
|
DefaultDirectedWeightedGraph
The default implementation of a directed weighted graph.
|
DefaultGraphType
Default implementation of the graph type.
|
DefaultGraphType.Builder
A builder for
DefaultGraphType . |
DefaultUndirectedGraph
The default implementation of an undirected graph.
|
DefaultUndirectedWeightedGraph
The default implementation of an undirected weighted graph.
|
DirectedAcyclicGraph
A directed acyclic graph (DAG).
|
DirectedAcyclicGraph.Region
An inclusive range of indices: [start, finish].
|
DirectedAcyclicGraph.TopoOrderMap
An interface for storing the topological ordering.
|
DirectedAcyclicGraph.VisitedStrategy
A strategy for marking vertices as visited.
|
DirectedAcyclicGraph.VisitedStrategyFactory
A visited strategy factory.
|
DirectedMultigraph
A directed multigraph.
|
DirectedPseudograph
A directed pseudograph.
|
DirectedWeightedMultigraph
A directed weighted multigraph.
|
DirectedWeightedPseudograph
A directed weighted pseudograph.
|
EdgeSetFactory
A factory for edge sets.
|
GraphDelegator
A graph backed by the the graph specified at the constructor, which delegates all its methods to
the backing graph.
|
GraphSpecificsStrategy
A graph specifics construction factory.
|
GraphWalk
A walk in a graph is an alternating sequence of vertices and edges, starting and ending at a
vertex, in which each edge is adjacent in the sequence to its two endpoints.
|
IntrusiveEdgesSpecifics
An interface for the set of intrusive edges of a graph.
|
Multigraph
A multigraph.
|
Pseudograph
A pseudograph.
|
SimpleDirectedGraph
A simple directed graph.
|
SimpleDirectedWeightedGraph
A simple directed weighted graph.
|
SimpleGraph
Implementation of a Simple Graph.
|
SimpleWeightedGraph
A simple weighted graph.
|
WeightedMultigraph
A weighted multigraph.
|
WeightedPseudograph
A weighted pseudograph.
|
Class and Description |
---|
AbstractGraph
A skeletal implementation of the Graph interface, to minimize the effort required to
implement graph interfaces.
|
GraphDelegator
A graph backed by the the graph specified at the constructor, which delegates all its methods to
the backing graph.
|
Class and Description |
---|
AbstractGraph
A skeletal implementation of the Graph interface, to minimize the effort required to
implement graph interfaces.
|
Class and Description |
---|
EdgeSetFactory
A factory for edge sets.
|
Class and Description |
---|
AbstractBaseGraph
The most general implementation of the
Graph interface. |
AbstractGraph
A skeletal implementation of the Graph interface, to minimize the effort required to
implement graph interfaces.
|
GraphSpecificsStrategy
A graph specifics construction factory.
|
IntrusiveEdgesSpecifics
An interface for the set of intrusive edges of a graph.
|
Class and Description |
---|
DefaultEdge
A default implementation for edges in a
Graph . |
DefaultWeightedEdge
A default implementation for edges in a weighted graph.
|
Copyright © 2019. All rights reserved.