| Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
| IdleDFSVisitor |
|
| 1.0;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 20.02.2005 | |
| 20 | * | |
| 21 | */ | |
| 22 | package net.sourceforge.combean.graph.alg.traversal; | |
| 23 | ||
| 24 | import net.sourceforge.combean.interfaces.graph.Edge; | |
| 25 | import net.sourceforge.combean.interfaces.graph.Node; | |
| 26 | import net.sourceforge.combean.interfaces.graph.alg.traverse.DFSVisitor; | |
| 27 | ||
| 28 | /** | |
| 29 | * Utility DFSVisitor with empty implementations for all necessary methods | |
| 30 | * of the interface DFSVisitor. Can be used as starting point for implementations | |
| 31 | * of DFSVisitors which do then not need to override all methods. | |
| 32 | * | |
| 33 | * @author schickin | |
| 34 | * | |
| 35 | */ | |
| 36 | public class IdleDFSVisitor extends IdleTraversalVisitor implements DFSVisitor { | |
| 37 | ||
| 38 | /** | |
| 39 | * constructor | |
| 40 | */ | |
| 41 | public IdleDFSVisitor() { | |
| 42 | 30 | super(); |
| 43 | 30 | } |
| 44 | ||
| 45 | /* (non-Javadoc) | |
| 46 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.DFSVisitor#leaveNeighbor(net.sourceforge.combean.interfaces.graph.Node, net.sourceforge.combean.interfaces.graph.Edge) | |
| 47 | */ | |
| 48 | public void leaveNeighbor(Edge e, Node from) { | |
| 49 | /* | |
| 50 | nothing to do | |
| 51 | */ | |
| 52 | 132 | } |
| 53 | ||
| 54 | /* (non-Javadoc) | |
| 55 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.DFSVisitor#leaveNode(net.sourceforge.combean.interfaces.graph.Node) | |
| 56 | */ | |
| 57 | public void leaveNode(Node v) { | |
| 58 | /* | |
| 59 | nothing to do | |
| 60 | */ | |
| 61 | 0 | } |
| 62 | } |