How to use

SearchOrder

in

cascading.flow.planner.iso.finder

private Iterator<Node> getIterator( SearchOrder searchOrder )
 {
 return SearchOrder.getNodeIterator( searchOrder, getDelegate() );
 }

public static <Node, G extends Graph> Iterator<Node> getNodeIterator( SearchOrder searchOrder, G graph )
 {
 if( searchOrder == null )
  return new TopologicalOrderIterator( graph ); // faster than getVertexSet().iterator()
 Node node = null;
 if( graph.containsVertex( Extent.head ) )
  {
  if( !searchOrder.isReversed() )
   node = (Node) Extent.head;
  else
   node = (Node) Extent.tail;
  }
 switch( searchOrder )
  {
  case Depth:
   return new DepthFirstIterator( graph, node );
  case Breadth:
   return new BreadthFirstIterator( graph, node );
  case Topological:
   return new TopologicalOrderIterator( graph ); // TODO: uses a equality based hashmap internally, will fail if relying on identity
  case ReverseDepth:
   return new DepthFirstIterator( new EdgeReversedGraph( graph ), node );
  case ReverseBreadth:
   return new BreadthFirstIterator( new EdgeReversedGraph( graph ), node );
  case ReverseTopological:
   return new TopologicalOrderIterator( new EdgeReversedGraph( graph ) ); // TODO: uses a equality based hashmap internally, will fail if relying on identity
  }
 throw new IllegalStateException( "unknown order: " + searchOrder );
 }
}

Iterator<FlowElement> iterator = SearchOrder.getNodeIterator( matchExpression.getSearchOrder(), directed( elementGraph ) );