Module org.jhotdraw8.graph
Package org.jhotdraw8.graph

Interface BareDirectedVertexGraph<V>

Type Parameters:
V - the vertex data type
All Known Subinterfaces:
BareBidiGraph<V,A>, BareDirectedGraph<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 BareDirectedVertexGraph<V>
Provides a minimal 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.

  • Method Summary

    Modifier and Type
    Method
    Description
    @NonNull V
    getNext(@NonNull V v, int index)
    Returns the next vertex associated with the specified vertex and outgoing arrow index.
    int
    getNextCount(@NonNull V v)
    Returns the number of next vertices at the specified vertex.
    @NonNull Set<V>
    getVertices()
    Returns all vertices.

  • Method Details

    • getNext

      @NonNull V getNext(@NonNull V v, int index)
      Returns the next vertex associated with the specified vertex and outgoing arrow index.
      Parameters:
      v - a vertex
      index - index of outgoing arrow
      Returns:
      the next vertex
      See Also:

    • getNextCount

      int getNextCount(@NonNull V v)
      Returns the number of next vertices at the specified vertex.

      This number is the same as the number of outgoing arrows at the specified vertex.

      Parameters:
      v - a vertex
      Returns:
      the number of next vertices

    • getVertices

      @NonNull Set<V> getVertices()
      Returns all vertices.
      Returns:
      a set view on all vertices