Interface BareDirectedGraph<V,A>

Type Parameters:
V - the vertex data type
A - the arrow data type
All Superinterfaces:
BareDirectedVertexGraph<V>
All Known Subinterfaces:
BareBidiGraph<V,A>, BidiGraph<V,A>, DirectedGraph<V,A>, MutableBidiGraph<V,A>, MutableDirectedGraph<V,A>
All Known Implementing Classes:
ImmutableAttributed16BitIndexedDirectedGraph, ImmutableAttributed32BitIndexedBidiGraph, ImmutableAttributed32BitIndexedDirectedGraph, IndexedBidiGraphBidiGraphFacade, IndexedDirectedGraphDirectedGraphFacade, SimpleMutableBidiGraph, SimpleMutableDirectedGraph

public interface BareDirectedGraph<V,A> extends BareDirectedVertexGraph<V>
A minimalistic read-only interface to a directed graph.

A directed graph is a tuple G = (V, A) where V is a set of vertices and A is a set or bag of arrows.

This facade supports a data object for each arrow. The type of the arrow data object is provided by the type parameter <A>.

Users of this interface may define <A> as a tuple (v_i, v_j) but are not required to do so, because this interface provides methods for accessing the next vertex of a given vertex without having to deal with the arrow object.

  • Method Details