Class IncrementalImmutableSequentialGraph

    • Field Detail

      • END_OF_GRAPH

        public static long[][] END_OF_GRAPH
        A marker for the end of the graph.
    • Constructor Detail

      • IncrementalImmutableSequentialGraph

        public IncrementalImmutableSequentialGraph()
    • Method Detail

      • numNodes

        public long numNodes()
        Description copied from class: ImmutableGraph
        Returns the number of nodes of this graph.

        Albeit this method is not optional, it is allowed that this method throws an UnsupportedOperationException if this graph has never been entirely traversed using a node iterator. This apparently bizarre behaviour is necessary to support implementations as ArcListASCIIGraph, which do not know the actual number of nodes until a traversal has been completed.

        Specified by:
        numNodes in class ImmutableGraph
        Returns:
        the number of nodes.
      • add

        public void add​(long[][] successor,
                        long offset,
                        long length)
                 throws java.lang.InterruptedException
        Adds a new node having as successors contained in the specified big array fragment.

        The fragment must be sorted in increasing order.

        Parameters:
        successor - a big array.
        offset - the first valid entry in successor.
        length - the number of valid entries.
        Throws:
        java.lang.InterruptedException
      • add

        public void add​(long[][] successor)
                 throws java.lang.InterruptedException
        Adds a new node having as successors contained in the specified big array.

        The array must be sorted in increasing order.

        Parameters:
        successor - a big array.
        Throws:
        java.lang.InterruptedException
      • add

        public void add​(long[] successor,
                        int offset,
                        int length)
                 throws java.lang.InterruptedException
        Adds a new node having as successors contained in the specified array fragment.

        The fragment must be sorted in increasing order.

        Parameters:
        successor - an array.
        offset - the first valid entry in successor.
        length - the number of valid entries.
        Throws:
        java.lang.InterruptedException
      • add

        public void add​(long[] successor)
                 throws java.lang.InterruptedException
        Adds a new node having as successors contained in the specified array.

        The array must be sorted in increasing order.

        Parameters:
        successor - an array.
        Throws:
        java.lang.InterruptedException