net.automatalib.util.graphs.copy.PlainGraphCopy 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.ArrayList;
import java.util.List;

import net.automatalib.commons.util.mappings.Mapping;
import net.automatalib.graphs.Graph;
import net.automatalib.graphs.MutableGraph;

final class PlainGraphCopy
		extends AbstractGraphCopy> {

	private static class NodeRec {
		private final N1 inNode;
		private final N2 outNode;
		
		public NodeRec(N1 inNode, N2 outNode) {
			this.inNode = inNode;
			this.outNode = outNode;
		}
	}
	
	public PlainGraphCopy(Graph inGraph,
			MutableGraph outGraph,
			Mapping npMapping,
			Mapping epMapping) {
		super(inGraph, outGraph, npMapping, epMapping);
	}

	@Override
	public void doCopy() {
		List> outNodes = new ArrayList<>(inGraph.size());
		// Copy nodes
		for(N1 n1 : inGraph) {
			N2 n2 = copyNode(n1);
			outNodes.add(new NodeRec<>(n1, n2));
		}
		
		// Copy edges
		for(NodeRec p : outNodes) {
			N1 n1 = p.inNode;
			N2 n2 = p.outNode;
			
			for(E1 edge : inGraph.getOutgoingEdges(n1)) {
				N1 tgt1 = inGraph.getTarget(edge);
				copyEdge(n2, edge, tgt1);
			}
		}
	}
	
}