All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.automatalib.util.automata.asgraph.AutomatonAsGraph Maven / Gradle / Ivy

Go to download

This artifact provides various common utility operations for analyzing and manipulating automata and graphs, such as traversal, minimization and copying.

There is a newer version: 0.11.0
Show newest version
/* Copyright (C) 2013 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 * 
 * AutomataLib is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License version 3.0 as published by the Free Software Foundation.
 * 
 * AutomataLib is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with AutomataLib; if not, see
 * http://www.gnu.de/documents/lgpl.en.html.
 */
package net.automatalib.util.automata.asgraph;

import java.util.Collection;
import java.util.Iterator;

import net.automatalib.automata.Automaton;
import net.automatalib.automata.concepts.StateIDs;
import net.automatalib.automata.graphs.TransitionEdge;
import net.automatalib.commons.util.mappings.MutableMapping;
import net.automatalib.graphs.Graph;
import net.automatalib.graphs.concepts.NodeIDs;


public class AutomatonAsGraph> implements Graph> {
	
	
	protected final A automaton;
	protected final Collection inputAlphabet;

	
	public AutomatonAsGraph(A automaton, Collection inputAlphabet) {
		this.automaton = automaton;
		this.inputAlphabet = inputAlphabet;
	}

	@Override
	public Iterator iterator() {
		return automaton.iterator();
	}

	@Override
	public Collection getNodes() {
		return automaton.getStates();
	}

	@Override
	public Collection> getOutgoingEdges(S node) {
		return AGHelper.outgoingEdges(automaton, node, inputAlphabet);
	}

	@Override
	public S getTarget(TransitionEdge edge) {
		return automaton.getSuccessor(edge.getTransition());
	}

	@Override
	public int size() {
		return automaton.size();
	}

	@Override
	public  MutableMapping createStaticNodeMapping() {
		return automaton.createStaticStateMapping();
	}

	@Override
	public  MutableMapping createDynamicNodeMapping() {
		return automaton.createDynamicStateMapping();
	}

	@Override
	public NodeIDs nodeIDs() {
		final StateIDs stateIds = automaton.stateIDs();
		return new NodeIDs() {
			@Override
			public int getNodeId(S node) {
				return stateIds.getStateId(node);
			}
			@Override
			public S getNode(int id) {
				return stateIds.getState(id);
			}
		};
	}

}