All Classes and Interfaces

Class	Description
AbstractBackLink<T>	Abstract base class for back links.
AbstractBackLinkWithCost<T,C>	Abstract base class for back links.
AbstractDirectedGraphBuilder	AbstractDirectedGraphBuilder.
AbstractMutableIndexedBidiGraph	AbstractDirectedGraphBuilder.
AddToIntSet	Represents a function that adds an element to a set if not already present.
AddToSet<E>	A function that adds an element to a set if not already present.
AdjacencyListWriter	Writes a graph as an adjacency list.
AllArcSequencesFinder<V,A,C>	Interface for finding all sequences between a set of source vertices and goal vertices up to a maximal depth in a directed graph.
AllArrowsSequencesFinder<V,A,C>	Interface for finding all sequences between a set of source vertices and goal vertices up to a maximal depth in a directed graph.
AllVertexSequencesFinder<V,A,C>	Interface for finding all sequences between a set of source vertices and goal vertices up to a maximal depth and a maximal cost in a directed graph.
AllWalksSpliterator<V,A,C,E>	Iterates over all walks from a set of start vertices to a set of goal vertices using a breadth-first search.
AnyArcPathSearchAlgo<V,A,C>	Searches an arbitrary path from a set of start vertices to a set of goal vertices using a breadth-first search algorithm.
AnyIndexedVertexPathSearchAlgo<C>	See AnyArcPathSearchAlgo for a description of this algorithm.
AnyIndexedVertexReachabilityAlgo<C>	See AnyArcPathSearchAlgo for a description of this algorithm.
AnyShortestArcPathSearchAlgo<V,A,C>	Searches an arbitrary shortest path from a set of start vertices to a set of goal vertices using Dijkstra's algorithm.
AnyShortestVertexPathSearchAlgo<V,C>	See AnyShortestArcPathSearchAlgo for a description of this algorithm.
AnyVertexPathSearchAlgo<V,C>	See AnyArcPathSearchAlgo for a description of this algorithm.
Arc<V,A>	Data record for an arrow with associated data in a directed graph.
ArcBackLink<V,A>	Represents an arc back link with depth.
ArcBackLinkWithAncestorSet<V,A>	Represents an arc back link with depth and a set of ancestors.
ArcBackLinkWithCost<V,A,C>	Represents an arc back link with cost and depth.
ArcPathSearchAlgo<V,A,C>	Interface for an arc path search algorithm over a directed graph.
ArcReachabilityAlgo<V,A,C>	Interface for a reachability checker algorithm over a directed graph.
ArcSequenceFinder<V,A,C>	Interface for finding Arc sequences up to (inclusive) a maximal cost in a directed graph.
ArrowSequenceFinder<V,A,C>	Interface for finding arrow sequences up to (inclusive) a maximal cost in a directed graph.
AttributedIndexedBidiGraph<V,A>	This interface provides read-only indexed access to a directed graph G = (V, A) with vertex and arrow attributes of the generic types V and A.
AttributedIndexedDirectedGraph<V,A>	This interface provides read-only indexed access to a directed graph G = (V, A) with vertex and arrow attributes of the generic types V and A.
BareBidiGraph<V,A>	Adds methods to the interface defined in BareDirectedGraph that allow to follow arrows in backward direction.
BareDirectedGraph<V,A>	A minimalistic read-only interface to a directed graph.
BareDirectedVertexGraph<V>	Provides a minimal read-only interface to a directed graph.
BfsDfsArcSpliterator<V,A>	Enumerates arcs in a graph starting from a root vertex in breadth-first-order or in depth-first-order.
BfsDfsIndexedVertexSpliterator	Enumerates vertices in a graph with indexed vertices starting from a root vertex in breadth-first-order or in depth-first-order.
BfsDfsVertexSpliterator<V>	Enumerates vertices in a graph starting from a root vertex in breadth-first-order or in depth-first-order.
BidiGraph<V,A>	Adds convenience methods to the interface defined in BareBidiGraph.
ChunkedMutableIndexedBidiGraph	A mutable indexed bi-directional graph.
CombinedAllSequencesFinder<V,A,C>	Interface for finding all sequences between a set of source vertices and goal vertices up to a maximal depth in a directed graph.
CombinedSequenceFinder<V,A,C>	Interface for finding arc-, arrow- and vertex-sequences up to (inclusive) a maximal cost in a directed graph.
DirectedGraph<V,A>	Adds convenience methods to the interface defined in BareDirectedGraph.
DirectedGraphBuilder	DirectedGraphBuilder.
DisjointSetsAlgo
GraphChunk	Interface for a chunk of a ChunkedMutableIndexedBidiGraph.
GraphvizReader<V,A>	Reads a graph from a graphviz "dot" file.
GraphvizWriter	Writes a graph into a graphviz "dot" file.
ImmutableAttributed16BitIndexedDirectedGraph<V,A>	ImmutableDirectedGraph.
ImmutableAttributed32BitIndexedBidiGraph<V,A>	ImmutableDirectedGraph.
ImmutableAttributed32BitIndexedDirectedGraph<V,A>	ImmutableDirectedGraph.
IndexedBidiGraph	This interface provides read access to a directed graph G = (int, A) .
IndexedBidiGraphBidiGraphFacade	Provides a BidiGraph facade for an IndexedBidiGraph.
IndexedDirectedGraph	Provides indexed read access to a directed graph G = (V, A) .
IndexedDirectedGraphDirectedGraphFacade	Provides a DirectedGraph facade for an IndexedDirectedGraph.
IndexedStronglyConnectedComponentsAlgo	Computes the sets of strongly connected components in an indexed directed graph.
IndexedVertexBackLink	Represents an indexed vertex back link with depth.
IndexedVertexBackLinkWithCost<C>	Represents an indexed vertex back link with cost and depth.
IndexedVertexPathSearchAlgo<C>	Interface for a vertex path search algorithm over an indexed directed graph.
IndexedVertexReachabilityAlgo<C>	Interface for a reachability checker algorithm over a directed graph.
IntAttributedIndexedBidiGraph	This interface combines IntAttributedIndexedBidiGraph and IndexedBidiGraph into one interface.
IntAttributedIndexedDirectedGraph	This interface adds accessors for vertex data and arrow data that is represented by an int.
MinimumSpanningTreeAlgo
MultiArrayCsrGraphChunk	Stores a chunk of a graph using a "Compressed Sparse Row" representation.
MutableBidiGraph<V,A>	Interface for a mutable directed graph that allows to follow arrows in backward direction.
MutableDirectedGraph<V,A>	Interface for a mutable directed graph.
MutableIndexedBidiGraph	MutableIndexedBidiGraph.
MutableIntAttributed16BitIndexedBidiGraph	A mutable indexed bi-directional graph.
PathBuilderException	PathBuilderException.
ReachabilityChecker<V,C>	Interface for checking if there is a vertex sequence up to (inclusive) a maximal cost in a directed graph.
SimpleCombinedAllSequencesFinder<V,A,C>	Implements the CombinedAllSequencesFinder interface.
SimpleCombinedSequenceFinder<V,A,C>	Implements the CombinedSequenceFinder interface.
SimpleIndexedVertexSequenceFinder<C>	Implements the VertexSequenceFinder interface.
SimpleMutableBidiGraph<V,A>	A mutable bidi graph with balanced performance for all operations.
SimpleMutableDirectedGraph<V,A>	SimpleMutableDirectedGraph.
SimpleReachabilityChecker<V,A,C>	Implements the ReachabilityChecker interface.
SimpleVertexSequenceFinder<V,C>	Implements the VertexSequenceFinder interface.
SingleArrayCsrGraphChunk	Stores a chunk of a graph using a "Compressed Sparse Row" representation.
StronglyConnectedComponentsAlgo	Computes the sets of strongly connected components in a directed graph.
TopologicalSortAlgo	Provides topological sort algorithms for directed graphs.
UniqueArcPathSearchAlgo<V,A,C>	Searches a globally unique vertex path from a set of start vertices to a set of goal vertices using a breadth-first search algorithm on a directed (potentially cyclic) graph (DIG).
UniqueOnAcyclicGraphArcPathSearchAlgo<V,A,C>	Searches a globally unique vertex path from a set of start vertices to a set of goal vertices using a breadth-first search algorithm on a directed acyclic graph.
UniqueOnAcyclicGraphVertexPathSearchAlgo<V,C>	See UniqueOnAcyclicGraphArcPathSearchAlgo for a description of this algorithm.
UniqueOrOneHopVertexPathSearchAlgo<V,C>	Builder for creating unique paths from a directed graph.
UniqueShortestArcPathSearchAlgo<V,A,C>	Searches a unique shortest path from a set of start vertices to a set of goal vertices using Dijkstra's algorithm.
UniqueShortestVertexPathSearchAlgo<V,C>	See UniqueShortestArcPathSearchAlgo for a description of this algorithm.
UniqueVertexPathSearchAlgo<V,C>	See UniqueArcPathSearchAlgo for a description of this algorithm.
VertexBackLink<V>	Represents a vertex back link with depth.
VertexBackLinkWithAncestorSet<V>	Represents a vertex back link with depth and a set of ancestors.
VertexBackLinkWithCost<V,C>	Represents a vertex back link with cost and depth.
VertexPathSearchAlgo<V,C>	Interface for a vertex path search algorithm.
VertexReachabilityAlgo<V,C>	Interface for a reachability test algorithm.
VertexSequenceFinder<V,C>	Interface for finding vertex sequences up to (inclusive) a maximal cost in a directed graph.