net.automatalib.util.graphs.copy.AbstractGraphCopy 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
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.
/* 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 net.automatalib.commons.util.mappings.Mapping;
import net.automatalib.commons.util.mappings.MutableMapping;
import net.automatalib.graphs.IndefiniteGraph;
import net.automatalib.graphs.MutableGraph;
abstract class AbstractGraphCopy> {
protected final MutableMapping nodeMapping;
protected final G1 inGraph;
protected final MutableGraph outGraph;
protected final Mapping super N1,? extends NP2> npMapping;
protected final Mapping super E1,? extends EP2> epMapping;
public AbstractGraphCopy(G1 inGraph, MutableGraph outGraph,
Mapping super N1,? extends NP2> npMapping, Mapping super E1,? extends EP2> epMapping) {
this.inGraph = inGraph;
this.outGraph = outGraph;
this.nodeMapping = inGraph.createStaticNodeMapping();
this.npMapping = npMapping;
this.epMapping = epMapping;
}
protected N2 copyNode(N1 node) {
NP2 prop = npMapping.get(node);
N2 n2 = outGraph.addNode(prop);
nodeMapping.put(node, n2);
return n2;
}
protected E2 copyEdge(N2 src2, E1 edge) {
return copyEdge(src2, edge, inGraph.getTarget(edge));
}
protected E2 copyEdge(N2 src2, E1 edge, N1 tgt1) {
EP2 prop = epMapping.get(edge);
N2 tgt2 = nodeMapping.get(tgt1);
return outGraph.connect(src2, tgt2, prop);
}
protected N2 copyEdgeChecked(N2 source, E1 edge, N1 tgt1) {
EP2 prop = epMapping.get(edge);
N2 tgt2 = nodeMapping.get(tgt1);
N2 freshTgt = null;
if(tgt2 == null)
freshTgt = tgt2 = copyNode(tgt1);
outGraph.connect(source, tgt2, prop);
return freshTgt;
}
public Mapping getNodeMapping() {
return nodeMapping;
}
public abstract void doCopy();
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy