Uses of Class
org.shared.parallel.LimitedMemoryPolicy.PolicyNode

Packages that use LimitedMemoryPolicy.PolicyNode

Package	Description
org.shared.parallel	A framework for specifying and executing parallel dataflow engines.

Uses of LimitedMemoryPolicy.PolicyNode in org.shared.parallel

Methods in org.shared.parallel that return LimitedMemoryPolicy.PolicyNode

Modifier and Type	Method and Description
protected LimitedMemoryPolicy.PolicyNode	LimitedMemoryPolicy.longestPath(Traversable<V,E> curr, Map<Traversable<V,E>,LimitedMemoryPolicy.PolicyNode> visitedMap) Sorts a LimitedMemoryPolicy.PolicyNode's children in decreasing order of maximum distance from the source.

Methods in org.shared.parallel with parameters of type LimitedMemoryPolicy.PolicyNode

Modifier and Type	Method and Description
protected int	LimitedMemoryPolicy.assignDepthFirst(LimitedMemoryPolicy.PolicyNode node, Set<LimitedMemoryPolicy.PolicyNode> partiallyVisited, Set<LimitedMemoryPolicy.PolicyNode> completelyVisited, int dfsCtr) A recursive subroutine for assigning traversal orders while traversing the LimitedMemoryPolicy.PolicyNode graph in a depth-first manner.
int	LimitedMemoryPolicy.PolicyNode.compareTo(LimitedMemoryPolicy.PolicyNode rhs) Compares maximum distance from the source.

Method parameters in org.shared.parallel with type arguments of type LimitedMemoryPolicy.PolicyNode

Modifier and Type	Method and Description
protected int	LimitedMemoryPolicy.assignDepthFirst(LimitedMemoryPolicy.PolicyNode node, Set<LimitedMemoryPolicy.PolicyNode> partiallyVisited, Set<LimitedMemoryPolicy.PolicyNode> completelyVisited, int dfsCtr) A recursive subroutine for assigning traversal orders while traversing the LimitedMemoryPolicy.PolicyNode graph in a depth-first manner.
protected int	LimitedMemoryPolicy.assignDepthFirst(LimitedMemoryPolicy.PolicyNode node, Set<LimitedMemoryPolicy.PolicyNode> partiallyVisited, Set<LimitedMemoryPolicy.PolicyNode> completelyVisited, int dfsCtr) A recursive subroutine for assigning traversal orders while traversing the LimitedMemoryPolicy.PolicyNode graph in a depth-first manner.
protected LimitedMemoryPolicy.PolicyNode	LimitedMemoryPolicy.longestPath(Traversable<V,E> curr, Map<Traversable<V,E>,LimitedMemoryPolicy.PolicyNode> visitedMap) Sorts a LimitedMemoryPolicy.PolicyNode's children in decreasing order of maximum distance from the source.