8990919293949596979899
Node top = (Node)stack.peek(); switch(visitor.visit(top)) { case END_PATH_AND_CONTINUE: paths.add(new Path(stack)); stack.pop(); continue; case END_PATH_AND_STOP: paths.add(new Path(stack)); break O;
979899100101102103104105106107
case END_PATH_AND_STOP: paths.add(new Path(stack)); break O; case KILL_PATH: stack.pop(); continue; case CONTINUE_PATH:
123124125126127128129130131132133
continue O; } //all adjacent have been processed or are in stack stack.pop(); } return(paths); } }