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

Interface Summary Interface Description DirectedAcyclicGraph.TopoOrderMap<V> An interface for storing the topological ordering.DirectedAcyclicGraph.VisitedStrategy A strategy for marking vertices as visited.DirectedAcyclicGraph.VisitedStrategyFactory A visited strategy factory.EdgeSetFactory<V,E> A factory for edge sets.GraphSpecificsStrategy<V,E> A graph specifics construction factory.IntrusiveEdgesSpecifics<V,E> An interface for the set of intrusive edges of a graph. 
Class Summary Class Description AbstractBaseGraph<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.DefaultDirectedWeightedGraph<V,E> The default implementation of a directed weighted graph.DefaultEdge A default implementation for edges in aGraph
.DefaultEdgeFunction<E,T> Default implementation of an edge function which uses a map to store values.DefaultGraphIterables<V,E> The default implementation of the graph iterables which simply delegates to the set implementations.DefaultGraphMapping<V,E> Implementation of the GraphMapping interface.DefaultGraphSpecificsStrategy<V,E> A default lookup specifics strategy implementation.DefaultGraphType Default implementation of the graph type.DefaultGraphType.Builder A builder forDefaultGraphType
.DefaultListenableGraph<V,E> A graph backed by the the graph specified at the constructor, which can be listened byGraphListener
s and byVertexSetListener
s.DefaultUndirectedGraph<V,E> The default implementation of an undirected graph.DefaultUndirectedWeightedGraph<V,E> The default implementation of an undirected weighted graph.DefaultWeightedEdge A default implementation for edges in a weighted graph.DirectedAcyclicGraph<V,E> A directed acyclic graph (DAG).DirectedAcyclicGraph.Region An inclusive range of indices: [start, finish].DirectedAcyclicGraph.TopoVertexBiMap<V> A dual map implementation of the topological order map.DirectedAcyclicGraph.VisitedArrayImpl A visited strategy using an array.DirectedAcyclicGraph.VisitedArrayListImpl A visited strategy using anArrayList
.DirectedAcyclicGraph.VisitedBitSetImpl A visited strategy which uses aBitSet
.DirectedAcyclicGraph.VisitedHashSetImpl A visited strategy using aHashSet
.DirectedMultigraph<V,E> A directed multigraph.DirectedPseudograph<V,E> A directed pseudograph.DirectedWeightedMultigraph<V,E> A directed weighted multigraph.DirectedWeightedPseudograph<V,E> A directed weighted pseudograph.EdgeReversedGraph<V,E> Provides an edgereversed view $g'$ of a directed graph $g$.FastLookupGraphSpecificsStrategy<V,E> The fast lookup specifics strategy implementation.GraphDelegator<V,E> A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph.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.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.SimpleDirectedWeightedGraph<V,E> A simple directed weighted graph.SimpleGraph<V,E> Implementation of a Simple Graph.SimpleWeightedGraph<V,E> A simple weighted graph.UniformIntrusiveEdgesSpecifics<V,E> An uniform weights variant of the intrusive edges specifics.WeightedIntrusiveEdgesSpecifics<V,E> A weighted variant of the intrusive edges specifics.WeightedMultigraph<V,E> A weighted multigraph.WeightedPseudograph<V,E> A weighted pseudograph. 
Exception Summary Exception Description GraphCycleProhibitedException Exception indicating that the vertexes supplied toDirectedAcyclicGraph
would cause a cycle.IntrusiveEdgeException SpecialRuntimeException
to signal thatIntrusiveEdge
is used incorrectly.InvalidGraphWalkException Exception thrown in the event that the path is invalid.