Defines an atomic calculation as part of a parallel dataflow graph.
Defines an edge relationship between two nodes.
Defines a container for storing the results of
|Traversable<V extends Traversable<V,E>,E extends Edge<V>>||
Defines a graph node as part of some total ordering on graph nodes.
|TraversalPolicy<V extends Traversable<V,E>,E extends Edge<V>>|
An execution engine class for pushing data through the guts of some parallel computation given as a directed, acyclic graph.
|LimitedMemoryPolicy<V extends Traversable<V,E>,E extends Edge<V>>||
An implementation of