- Type Parameters:
V- the vertex data typeA- 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
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 Summary
Modifier and TypeMethodDescriptiongetNextArrow(@NonNull V v, int index) Returns the arrow data associated with the specified vertex and outgoing arrow index.Methods inherited from interface org.jhotdraw8.graph.BareDirectedVertexGraph
getNext, getNextCount, getVertices
-
Method Details
-
getNextArrow
Returns the arrow data associated with the specified vertex and outgoing arrow index.- Parameters:
v- a vertexindex- index of outgoing arrow- Returns:
- the next arrow data
- See Also:
-