Coverage Report - net.sourceforge.combean.interfaces.graph.alg.traverse.DFSVisitor
 
Classes in this File Line Coverage Branch Coverage Complexity
DFSVisitor
N/A
N/A
1
 
 1  
 /*
 2  
     This file is part of Combean.
 3  
 
 4  
     Combean is free software; you can redistribute it and/or modify
 5  
     it under the terms of the GNU General Public License as published by
 6  
     the Free Software Foundation; either version 2 of the License, or
 7  
     (at your option) any later version.
 8  
 
 9  
     Combean is distributed in the hope that it will be useful,
 10  
     but WITHOUT ANY WARRANTY; without even the implied warranty of
 11  
     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 12  
     GNU General Public License for more details.
 13  
 
 14  
     You should have received a copy of the GNU General Public License
 15  
     along with Combean; if not, write to the Free Software
 16  
     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 17  
 */
 18  
 /*
 19  
  * Created on 14.01.2005
 20  
  *
 21  
  */
 22  
 package net.sourceforge.combean.interfaces.graph.alg.traverse;
 23  
 
 24  
 import net.sourceforge.combean.interfaces.graph.Edge;
 25  
 import net.sourceforge.combean.interfaces.graph.Node;
 26  
 
 27  
 /**
 28  
  * An extended TraversalVisitor which allows to signal when a DFS traversal
 29  
  * leaves the current node (i.e. the complete set of nodes reachable from that
 30  
  * node has been explored).
 31  
  * 
 32  
  * @author schickin
 33  
  *
 34  
  */
 35  
 public interface DFSVisitor extends TraversalVisitor {
 36  
         
 37  
         /**
 38  
          * The exploration of all nodes reachable from v ends.
 39  
          * 
 40  
          * @param v
 41  
          */
 42  
         void leaveNode(Node v);
 43  
         
 44  
         /**
 45  
          * The exploration of all nodes reachable from a neighbor of v ends.
 46  
          * @param e the edge leading to the neighbor of v
 47  
          * @param from
 48  
          */
 49  
         void leaveNeighbor(Edge e, Node from);
 50  
 
 51  
 }