| Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
| IdleTraversalVisitor |
|
| 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 | * A TraversalVisistor which does nothing. Intended to be used as convenient | |
| 20 | * base class if a TraversalVisitor shall be implemented which works only with | |
| 21 | * very few callbacks. | |
| 22 | * | |
| 23 | * Created on 14.01.2005 | |
| 24 | * | |
| 25 | */ | |
| 26 | package net.sourceforge.combean.graph.alg.traversal; | |
| 27 | ||
| 28 | import net.sourceforge.combean.interfaces.graph.Edge; | |
| 29 | import net.sourceforge.combean.interfaces.graph.Graph; | |
| 30 | import net.sourceforge.combean.interfaces.graph.Node; | |
| 31 | import net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor; | |
| 32 | ||
| 33 | /** | |
| 34 | * @author schickin | |
| 35 | * | |
| 36 | */ | |
| 37 | public class IdleTraversalVisitor implements TraversalVisitor { | |
| 38 | ||
| 39 | /** | |
| 40 | * | |
| 41 | */ | |
| 42 | public IdleTraversalVisitor() { | |
| 43 | 93 | super(); |
| 44 | 93 | } |
| 45 | ||
| 46 | /** | |
| 47 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#readyToTerminate() | |
| 48 | */ | |
| 49 | public boolean readyToTerminate() { | |
| 50 | 0 | return false; |
| 51 | } | |
| 52 | ||
| 53 | /** | |
| 54 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#openNeighbor(net.sourceforge.combean.interfaces.graph.Edge, net.sourceforge.combean.interfaces.graph.Node) | |
| 55 | */ | |
| 56 | public void openNeighbor(Edge e, Node from) { | |
| 57 | /* do nothing */ | |
| 58 | 294 | } |
| 59 | ||
| 60 | /** | |
| 61 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#reopenNeighbor(net.sourceforge.combean.interfaces.graph.Edge, net.sourceforge.combean.interfaces.graph.Node) | |
| 62 | */ | |
| 63 | public void reopenNeighbor(Edge e, Node from) { | |
| 64 | /* do nothing */ | |
| 65 | 213 | } |
| 66 | ||
| 67 | /** | |
| 68 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#visitNode(net.sourceforge.combean.interfaces.graph.Node) | |
| 69 | */ | |
| 70 | public void visitNode(Node v) { | |
| 71 | /* do nothing */ | |
| 72 | 222 | } |
| 73 | ||
| 74 | /** | |
| 75 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#visitComponent(net.sourceforge.combean.interfaces.graph.Node) | |
| 76 | */ | |
| 77 | public void visitComponent(Node v) { | |
| 78 | /* do nothing */ | |
| 79 | 111 | } |
| 80 | ||
| 81 | /** | |
| 82 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#leaveComponent(net.sourceforge.combean.interfaces.graph.Node) | |
| 83 | */ | |
| 84 | public void leaveComponent(Node v) { | |
| 85 | /* do nothing */ | |
| 86 | 111 | } |
| 87 | ||
| 88 | /** | |
| 89 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#init(Graph) | |
| 90 | */ | |
| 91 | public void init(Graph g) { | |
| 92 | /* do nothing */ | |
| 93 | 12 | } |
| 94 | ||
| 95 | /** | |
| 96 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#initLocal(Graph, net.sourceforge.combean.interfaces.graph.Node) | |
| 97 | */ | |
| 98 | public void initLocal(Graph g, Node startNode) { | |
| 99 | /* do nothing */ | |
| 100 | 0 | } |
| 101 | ||
| 102 | /* (non-Javadoc) | |
| 103 | * @see net.sourceforge.combean.interfaces.graph.alg.traverse.TraversalVisitor#finish() | |
| 104 | */ | |
| 105 | public void finish() { | |
| 106 | /* do nothing */ | |
| 107 | 0 | } |
| 108 | } |