/*

     This file is part of Combean.

     Combean is free software; you can redistribute it and/or modify

     it under the terms of the GNU General Public License as published by

     the Free Software Foundation; either version 2 of the License, or

     (at your option) any later version.

     Combean is distributed in the hope that it will be useful,

     but WITHOUT ANY WARRANTY; without even the implied warranty of

     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

     GNU General Public License for more details.

     You should have received a copy of the GNU General Public License

     along with Combean; if not, write to the Free Software

     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

 */

 /*

  * Created on 24.03.2005

  *

  */

 package net.sourceforge.combean.graph.alg.traversal;

 import net.sourceforge.combean.interfaces.graph.Node;

 import net.sourceforge.combean.interfaces.graph.containers.NodeStack;

 /**

  * Puts all nodes on a NodeStack upon finishing their visit.

  * 

  * @see net.sourceforge.combean.interfaces.graph.containers.NodeStack

  * 

  * @author schickin

  *

  */

 public class DFSFinishedNodeOnStackVisitor extends IdleDFSVisitor {

     private NodeStack stack = null;

     /**

      * Constructor

      * 

      * @param stack the stack to be filled with the visited nodes

      */

     public DFSFinishedNodeOnStackVisitor(NodeStack stack) {

         super();

         this.stack = stack;

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.alg.traverse.DFSVisitor#leaveNode(net.sourceforge.combean.interfaces.graph.Node)

      */

     public void leaveNode(Node v) {

         this.stack.push(v);

     }

 }