001/* Copyright (C) 2013 TU Dortmund
002 * This file is part of AutomataLib, http://www.automatalib.net/.
003 * 
004 * AutomataLib is free software; you can redistribute it and/or
005 * modify it under the terms of the GNU Lesser General Public
006 * License version 3.0 as published by the Free Software Foundation.
007 * 
008 * AutomataLib is distributed in the hope that it will be useful,
009 * but WITHOUT ANY WARRANTY; without even the implied warranty of
010 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
011 * Lesser General Public License for more details.
012 * 
013 * You should have received a copy of the GNU Lesser General Public
014 * License along with AutomataLib; if not, see
015 * http://www.gnu.de/documents/lgpl.en.html.
016 */
017package net.automatalib.util.graphs.traversal;
018
019import net.automatalib.commons.util.Holder;
020
021public class DefaultGraphTraversalVisitor<N, E, D> implements
022                GraphTraversalVisitor<N, E, D> {
023
024        @Override
025        public GraphTraversalAction processInitial(N initialNode, Holder<D> outData) {
026                return GraphTraversalAction.EXPLORE;
027        }
028
029        @Override
030        public boolean startExploration(N node, D data) {
031                return true;
032        }
033
034        @Override
035        public void finishExploration(N node, D data) {
036        }
037
038        @Override
039        public GraphTraversalAction processEdge(N srcNode, D srcData, E edge, N tgtNode,
040                        Holder<D> outData) {
041                return GraphTraversalAction.EXPLORE;
042        }
043
044        @Override
045        public void backtrackEdge(N srcNode, D srcData, E edge, N tgtNode, D tgtData) {
046        }
047
048}