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.automata.asgraph; 018 019import java.util.ArrayList; 020import java.util.Collection; 021import java.util.List; 022 023import net.automatalib.automata.Automaton; 024import net.automatalib.automata.graphs.TransitionEdge; 025 026 027 028public class AGHelper { 029 030 031 public static <S,I,T> Collection<TransitionEdge<I,T>> outgoingEdges(Automaton<S,I,T> aut, S state, Collection<? extends I> inputAlphabet) { 032 List<TransitionEdge<I,T>> result 033 = new ArrayList<TransitionEdge<I,T>>(); 034 035 036 for(I input : inputAlphabet) { 037 Collection<T> transitions = aut.getTransitions(state, input); 038 if(transitions == null) 039 continue; 040 for(T t : transitions) 041 result.add(new TransitionEdge<>(input, t)); 042 } 043 044 return result; 045 } 046 047 048}