public class ReverseDependencyOrderWalker
Visit a plan in the reverse of the dependency order. That is, every node
after every node that depends on it is visited. Thus this is equivalent to
doing a reverse topilogical sort on the graph and then visiting it in order.
Fields inherited from class org.apache.pig.newplan.PlanWalker
Return a new instance of this same type of walker for a subplan.
When this method is called the same type of walker with the
provided plan set as the plan, must be returned. This can then be
used to walk subplans. This allows abstract visitors to clone
walkers without knowning the type of walker their subclasses used.