8485868788899091929394
stack.push(from); int iterations = 0; O: while(!stack.isEmpty() && (iterations++ < m_maxitr)) { //peek the stack Node top = (Node)stack.peek(); switch(visitor.visit(top)) { case END_PATH_AND_CONTINUE: paths.add(new Path(stack)); stack.pop();