Module org.jgrapht.core
Package org.jgrapht.graph
package org.jgrapht.graph
Implementations of various graphs.

ClassDescriptionAbstractBaseGraph<V,
E> The most general implementation of theGraph
interface.AbstractGraph<V,E> A skeletal implementation of theGraph
interface, to minimize the effort required to implement graph interfaces.AsGraphUnion<V,E> Readonly union of two graphs.AsSubgraph<V,E> A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph.AsUndirectedGraph<V,E> An undirected view of the backing directed graph specified in the constructor.AsUnmodifiableGraph<V,E> An unmodifiable view of the backing graph specified in the constructor.AsUnweightedGraph<V,E> Provides an unweighted view on a graph.AsWeightedGraph<V,E> Provides a weighted view of a graph.BaseIntrusiveEdgesSpecifics<V,E, IE extends org.jgrapht.graph.IntrusiveEdge> A base implementation for the intrusive edges specifics.DefaultDirectedGraph<V,E> The default implementation of a directed graph.The default implementation of a directed weighted graph.A default implementation for edges in aGraph
.DefaultEdgeFunction<E,T> Default implementation of an edge function which uses a map to store values.The default implementation of the graph iterables which simply delegates to the set implementations.DefaultGraphMapping<V,E> Implementation of the GraphMapping interface.A default lookup specifics strategy implementation.Default implementation of the graph type.A builder forDefaultGraphType
.A graph backed by the the graph specified at the constructor, which can be listened byGraphListener
s and byVertexSetListener
s.The default implementation of an undirected graph.The default implementation of an undirected weighted graph.A default implementation for edges in a weighted graph.DirectedAcyclicGraph<V,E> A directed acyclic graph (DAG).An inclusive range of indices: [start, finish].An interface for storing the topological ordering.A dual map implementation of the topological order map.A visited strategy using an array.A visited strategy using anArrayList
.A visited strategy which uses aBitSet
.A visited strategy using aHashSet
.A strategy for marking vertices as visited.A visited strategy factory.DirectedMultigraph<V,E> A directed multigraph.DirectedPseudograph<V,E> A directed pseudograph.A directed weighted multigraph.A directed weighted pseudograph.EdgeReversedGraph<V,E> Provides an edgereversed view $g'$ of a directed graph $g$.EdgeSetFactory<V,E> A factory for edge sets.The fast lookup specifics strategy implementation.Exception indicating that the vertexes supplied toDirectedAcyclicGraph
would cause a cycle.GraphDelegator<V,E> 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.GraphWalk<V,E> 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.SpecialRuntimeException
to signal thatIntrusiveEdge
is used incorrectly.An interface for the set of intrusive edges of a graph.Exception thrown in the event that the path is invalid.MaskSubgraph<V,E> An unmodifiable subgraph induced by a vertex/edge masking function.Multigraph<V,E> A multigraph.ParanoidGraph<V,E> ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract.Pseudograph<V,E> A pseudograph.SimpleDirectedGraph<V,E> A simple directed graph.A simple directed weighted graph.SimpleGraph<V,E> Implementation of a Simple Graph.SimpleWeightedGraph<V,E> A simple weighted graph.An uniform weights variant of the intrusive edges specifics.A weighted variant of the intrusive edges specifics.WeightedMultigraph<V,E> A weighted multigraph.WeightedPseudograph<V,E> A weighted pseudograph.