Uses of Interface
goldman.collection.positional.PositionalCollection

Packages that use PositionalCollection
goldman.collection.positional A positional collection is a manually positioned collection in which elements are accessed via their position in a line (with 0 being the position of the first element in the line) or via their location relative to other elements in the line. 
goldman.graph A graph represents general relationships between pairs of elements from among a set of elements. 
 

Uses of PositionalCollection in goldman.collection.positional
 

Classes in goldman.collection.positional that implement PositionalCollection
 class AbstractPositionalCollection<E>
          The AbstractPositionalCollection provides a basis for defining concrete positional collections by defining a useful set of methods that can be implemented for any positional collection in terms of the public methods from the PositionalCollection interface.
 class Array<E>
          The simplest of the positional collections, Array provides space for a fixed number of elements, which are stored in an underlying Java primitive array.
 class CircularArray<E>
          This array-based data structure allows element 0 of the positional collection to be in any slot of the underlying array, with the range of underlying indices wrapping around as needed.
 class DoublyLinkedList<E>
          The doubly linked list is the only positional collection data structure that provides amortized constant time methods for all of the PositionalCollectionLocator methods except getCurrentPosition.
 class DynamicArray<E>
          This array-based data structure provides space for a fixed number of elements, which are stored in an underlying Java primitive array.
 class DynamicCircularArray<E>
          This array-based data structure allows element 0 of the positional collection to be in any slot of the underlying array, with the range of underlying indices wrapping around as needed, and also performs automatic resizing.
 class SinglyLinkedList<E>
          The simplest of the list-based positional collections, SinglyLinkedList maintains a linked list where each list node only references the next element in the list.
 class TrackedArray<E>
          This array-based data structure can wrap any of the other array-based data structures to create a tracked implementation of the wrapped data structure.
 

Uses of PositionalCollection in goldman.graph
 

Methods in goldman.graph that return PositionalCollection
 PositionalCollection<E> Graph.getCycle()
          Returns a positional collection containing the edges in some cycle in this graph, in the order they appear in the cycle.
 PositionalCollection<E> AbstractGraph.getCycle()
          The hasCycle method can be used to determine if the graph has a directed cycle.
 PositionalCollection<E> InTree.getCycleReachableFromSource()
           
 PositionalCollection<E> ShortestPathMatrix.getNegativeWeightCycle()
           
 PositionalCollection<E> ShortestPathMatrix.getPath(V source, V dest)
           
 PositionalCollection<E> InTree.getPathFromSource(V dest)
           
 PositionalCollection<V> Graph.topologicalOrder()
          Returns a positional collection that holds a permutation of the vertices of a directed graph in a valid topological order.
 PositionalCollection<V> AbstractGraph.topologicalOrder()
          The hasCycle method can be called first to find out if the graph has a cycle.