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.graphs;
018
019import net.automatalib.graphs.concepts.NodeAcceptance;
020
021/**
022 * Interface for finite graphs that embody the concept of node acceptance.
023 * 
024 * @author Malte Isberner <malte.isberner@gmail.com>
025 *
026 * @param <N> node class
027 * @param <E> edge class
028 */
029public interface AcceptanceGraph<N, E> extends Graph<N, E>, NodeAcceptance<N> {
030}
031