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 java.util.Collection;
020
021import net.automatalib.graphs.concepts.NodeIDs;
022
023
024/**
025 * Graph interface. Like an {@link IndefiniteGraph}, but with the additional requirement
026 * that the set of nodes be finite.
027 * 
028 * @author Malte Isberner <malte.isberner@gmail.com>
029 *
030 * @param <N> node class
031 * @param <E> edge class
032 */
033public interface Graph<N, E> extends IndefiniteGraph<N,E>, Iterable<N> {
034        
035        /**
036         * Retrieves the number of nodes of this graph.
037         * @return the number of nodes of this graph.
038         */
039        public int size();
040        
041        /**
042         * Retrieves an (unmodifiable) collection of the nodes in this graph. 
043         * @return the nodes in this graph
044         */
045        public Collection<N> getNodes();
046        
047        
048        public NodeIDs<N> nodeIDs();
049        
050}