Interface NodeSequence

  • All Known Implementing Classes:
    Cycle, Path, Walk

    public interface NodeSequence
    Represents a sequence of nodes in a graph.
    Author:
    Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net
    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      Node getFirst()
      Returns the first node in the sequence.
      Node getLast()
      Returns the last node in the sequence.
      boolean isValid()
      Determines if the node sequence id valid based on the rules of the implementation.
      Iterator iterator()
      Returns an iterator over the nodes.
      int size()
      Returns the number of nodes in the sequence.
    • Method Detail

      • getFirst

        Node getFirst()
        Returns the first node in the sequence.
        Returns:
        Object of tupe Node.
      • getLast

        Node getLast()
        Returns the last node in the sequence.
        Returns:
        Object of type node.
      • size

        int size()
        Returns the number of nodes in the sequence.
        Returns:
        an integer representing the number of nodes in the sequence.
      • iterator

        Iterator iterator()
        Returns an iterator over the nodes.
        Returns:
        An iterator.
      • isValid

        boolean isValid()
        Determines if the node sequence id valid based on the rules of the implementation.
        Returns:
        True if valid, otherwise false.