Uses of Package
org.jgrapht.graph
Package
Description
Algorithms provided with JGraphT.
Algorithms dealing with various connectivity aspects of a graph.
Algorithms related to graph cycles.
Algorithms for computing maximum density subgraphs.
Flow related algorithms.
Algorithm related interfaces.
Generators for graphs of various topologies.
Implementations of various graphs.
Implementations of various concurrent graph structures.
Implementations of specifics for various graph types.
Specialized graph implementations using the FastUtil library
Specialized graph implementations using sparse matrix representations.
Immutable graphs stored using Sux4J's quasi-succinct data
structures.
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
Adapters for graphs stored using
WebGraph's compressed and succinct
formats.
-
ClassDescriptionA directed acyclic graph (DAG).A simple directed graph.
-
ClassDescriptionThe most general implementation of the
Graph
interface.A skeletal implementation of theGraph
interface, to minimize the effort required to implement graph interfaces.Implementation of a Simple Graph. -
ClassDescriptionA 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.
-
-
ClassDescriptionA default implementation for edges in a weighted graph.A simple weighted graph.
-
-
-
ClassDescriptionThe most general implementation of the
Graph
interface.A skeletal implementation of theGraph
interface, to minimize the effort required to implement graph interfaces.A base implementation for the intrusive edges specifics.The default implementation of a directed graph.The default implementation of a directed weighted graph.Default implementation of the graph type.A builder forDefaultGraphType
.The default implementation of an undirected graph.The default implementation of an undirected weighted graph.A directed acyclic graph (DAG).An inclusive range of indices: [start, finish].An interface for storing the topological ordering.A strategy for marking vertices as visited.A visited strategy factory.A directed multigraph.A directed pseudograph.A directed weighted multigraph.A directed weighted pseudograph.A factory for edge sets.A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph.A graph specifics construction factory.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.An interface for the set of intrusive edges of a graph.A multigraph.A pseudograph.A simple directed graph.A simple directed weighted graph.Implementation of a Simple Graph.A simple weighted graph.A weighted multigraph.A weighted pseudograph. -
ClassDescriptionA skeletal implementation of the
Graph
interface, to minimize the effort required to implement graph interfaces.A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph. -
ClassDescriptionA skeletal implementation of the
Graph
interface, to minimize the effort required to implement graph interfaces. -
-
ClassDescriptionThe most general implementation of the
Graph
interface.A skeletal implementation of theGraph
interface, to minimize the effort required to implement graph interfaces.A graph specifics construction factory.An interface for the set of intrusive edges of a graph. -
ClassDescriptionA skeletal implementation of the
Graph
interface, to minimize the effort required to implement graph interfaces. -
ClassDescriptionA skeletal implementation of the
Graph
interface, to minimize the effort required to implement graph interfaces. -
ClassDescriptionA skeletal implementation of the
Graph
interface, to minimize the effort required to implement graph interfaces. -
ClassDescriptionA default implementation for edges in a
Graph
.A default implementation for edges in a weighted graph. -
ClassDescriptionA skeletal implementation of the
Graph
interface, to minimize the effort required to implement graph interfaces.