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.concepts;
018
019/**
020 * Node acceptance concept, for {@link Graph}s that represent a structure for
021 * deciding acceptance or rejection.
022 * 
023 * @author Malte Isberner <malte.isberner@gmail.com>
024 *
025 * @param <N> node class
026 */
027public interface NodeAcceptance<N> {
028        
029        /**
030         * Checks whether a node is an accepting node.
031         * @param node the node
032         * @return <tt>true</tt> if the given node is an accepting node, <tt>false</tt>
033         * otherwise.
034         */
035        public boolean isAcceptingNode(N node);
036}