net.automatalib.util.graphs.copy.GraphCopy Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of automata-util Show documentation

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.graphs.copy;

import java.util.Collection;

import net.automatalib.commons.util.mappings.Mapping;
import net.automatalib.commons.util.mappings.Mappings;
import net.automatalib.graphs.Graph;
import net.automatalib.graphs.IndefiniteGraph;
import net.automatalib.graphs.MutableGraph;
import net.automatalib.graphs.UniversalGraph;
import net.automatalib.graphs.UniversalIndefiniteGraph;
import net.automatalib.util.graphs.Graphs;
import net.automatalib.util.traversal.TraversalOrder;

public class GraphCopy {
	
	
	
	public static 
	Mapping copyPlain(Graph in,
			MutableGraph out,
			Mapping npMapping,
			Mapping epMapping) {
		PlainGraphCopy copy = new PlainGraphCopy<>(in, out, npMapping, epMapping);
		copy.doCopy();
		return copy.getNodeMapping();
	}
	
	public static 
	Mapping copyPlain(UniversalGraph in,
			MutableGraph out) {
		Mapping npMapping = Graphs.nodeProperties(in);
		Mapping epMapping = Graphs.edgeProperties(in);
		return copyPlain(in, out, npMapping, epMapping);
	}
	
	public static 
	Mapping copyUniversalPlain(UniversalGraph in,
			MutableGraph out,
			Mapping npConversion,
			Mapping epConversion) {
		Mapping npMapping = Mappings.compose(Graphs.nodeProperties(in), npConversion);
		Mapping epMapping = Mappings.compose(Graphs.edgeProperties(in), epConversion);
		return copyPlain(in, out, npMapping, epMapping);
	}
	
	public static 
	Mapping copyTraversal(IndefiniteGraph in,
			MutableGraph out,
			TraversalOrder order,
			int limit,
			Collection initialNodes,
			Mapping npMapping,
			Mapping epMapping) {
		TraversalGraphCopy copy
			= new TraversalGraphCopy<>(order, limit, in, initialNodes, out, npMapping, epMapping);
		copy.doCopy();
		return copy.getNodeMapping();
	}
	
	public static 
	Mapping copyTraversal(UniversalIndefiniteGraph in,
			MutableGraph out,
			TraversalOrder order,
			int limit,
			Collection initialNodes) {
		Mapping npMapping = Graphs.nodeProperties(in);
		Mapping epMapping = Graphs.edgeProperties(in);
		return copyTraversal(in, out, order, limit, initialNodes, npMapping, epMapping);
	}
	
	public static 
	Mapping copyUniversalTraversal(UniversalIndefiniteGraph in,
			MutableGraph out,
			TraversalOrder order,
			int limit,
			Collection initialNodes,
			Mapping npConversion,
			Mapping epConversion) {
		Mapping npMapping = Mappings.compose(Graphs.nodeProperties(in), npConversion);
		Mapping epMapping = Mappings.compose(Graphs.edgeProperties(in), epConversion);
		return copyTraversal(in, out, order, limit, initialNodes, npMapping, epMapping);
	}

}