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 019public interface DFSVisitor<N, E, D> { 020 public D initialize(N node); 021 public void explore(N node, D data); 022 public void finish(N node, D data); 023 024 public D treeEdge(N srcNode, D srcData, E edge, N tgtNode); 025 public void backEdge(N srcNode, D srcData, E edge, N tgtNode, D tgtData); 026 public void crossEdge(N srcNode, D srcData, E edge, N tgtNode, D tgtData); 027 public void forwardEdge(N srcNode, D srcData, E edge, N tgtNode, D tgtData); 028 029 public void backtrackEdge(N srcNode, D srcDate, E edge, N tgtNode, D tgtData); 030}