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

Class ImmutableAttributed32BitIndexedBidiGraph<V,A>

java.lang.Object
org.jhotdraw8.graph.ImmutableAttributed32BitIndexedBidiGraph<V,A>
Type Parameters:
V - the vertex data type
A - the arrow data type
All Implemented Interfaces:
AttributedIndexedBidiGraph<V,A>, AttributedIndexedDirectedGraph<V,A>, BareBidiGraph<V,A>, BareDirectedGraph<V,A>, BareDirectedVertexGraph<V>, BidiGraph<V,A>, DirectedGraph<V,A>, IndexedBidiGraph, IndexedDirectedGraph
public class ImmutableAttributed32BitIndexedBidiGraph<V,A> extends Object implements AttributedIndexedBidiGraph<V,A>, BidiGraph<V,A>
ImmutableDirectedGraph. Uses int-arrays for storage.

Supports up to 2^31 - 1 vertices.

Uses a representation that is similar to a compressed row storage for matrices (CRS). A bidirectional graph is represented with 7 arrays: nextOffset, next, nextArrows, prevOffset, prev, prevArrows, and vertices.

nextOffset
Holds for each vertex v, the offset into the arrays next, and nextArrows. The data for vertex v can be found in these arrays in the elements from nextOffset[v](inclusive) to nextOffset[v + 1] (exclusive).
next
Holds for each arrow from a vertex v to a vertex u the index of u.
nextArrows
Holds for each arrow from a vertex v to a vertex u the data associated to the arrow.
prevOffset, next, nextArrows
These arrays have the same structure as nextOffset, next, nextArrows but they they store for a vertex v the data for ingoing arrows from a vertex u to the vertex v
vertices
Holds for each vertex v the data associated to the vertex.
Author:
Werner Randelshofer

  • Field Details

    • next

      protected final int @NonNull [] next
      Holds the indices to the next vertices.

      The indices are stored in consecutive runs for each vertex, starting at the offset given by nextOffset.

      Given vertex index vi < nextOffset.length - 1
      then
      offset = nextOffset[vi] count = nextOffset[vi+1] - offset

      Given vertex index vi == nextOffset.length - 1
      then
      offset = nextOffset[vi] count = nextOffset.length - offset

    • prev

      protected final int @NonNull [] prev

    • nextOffset

      protected final int @NonNull [] nextOffset
      Holds offsets into the next table and the nextArrows table.

      Given vertex index vi,
      nextOffset[vi] yields the offset ai in the tables next table and the nextArrows.

      Given vertex index vi < nextOffset.length - 1,
      nextOffset[vi+1]) - nextOffset[vi] yields the number of outgoing arrows of that vertex.

      Given vertex index vi == nextOffset.length - 1,
      nextOffset.length - nextOffset[vi] yields the number of outgoing arrows of that vertex.

    • prevOffset

      protected final int @NonNull [] prevOffset

    • nextArrows

      protected final @NonNull A @NonNull [] nextArrows
      Holds the arrow objects.

      The arrows are stored in consecutive runs for each vertex, starting at the offset given by nextOffset.

      See next.

    • prevArrows

      protected final @NonNull A @NonNull [] prevArrows

    • vertices

      protected final @NonNull V @NonNull [] vertices
      Holds the vertex objects.

      Given vertex index vi,
      vertices[vi| yields the vertex v.

    • vertexToIndexMap

      protected final @NonNull Map<V,Integer> vertexToIndexMap
      Maps vertices the vertex indices.

      Given vertex v,
      vertexToIndexMap.get(v) yields the vertex index vi.

  • Constructor Details

    • ImmutableAttributed32BitIndexedBidiGraph

      public ImmutableAttributed32BitIndexedBidiGraph(@NonNull AttributedIndexedBidiGraph<V,A> graph)
      Creates a new instance from the specified graph.
      Parameters:
      graph - a graph

    • ImmutableAttributed32BitIndexedBidiGraph

      public ImmutableAttributed32BitIndexedBidiGraph(@NonNull BidiGraph<V,A> graph)
      Creates a new instance from the specified graph.
      Parameters:
      graph - a graph

  • Method Details