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

net.automatalib.util.graphs.copy.AbstractGraphCopy 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-2019 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
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 npMapping;
    protected final Mapping epMapping;

    AbstractGraphCopy(G1 inGraph,
                      MutableGraph outGraph,
                      Mapping npMapping,
                      Mapping epMapping) {
        this.inGraph = inGraph;
        this.outGraph = outGraph;
        this.nodeMapping = inGraph.createStaticNodeMapping();
        this.npMapping = npMapping;
        this.epMapping = epMapping;
    }

    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) {
            tgt2 = copyNode(tgt1);
            freshTgt = tgt2;
        }

        outGraph.connect(source, tgt2, prop);
        return freshTgt;
    }

    protected N2 copyNode(N1 node) {
        NP2 prop = npMapping.get(node);
        N2 n2 = outGraph.addNode(prop);

        nodeMapping.put(node, n2);
        return n2;
    }

    public Mapping getNodeMapping() {
        return nodeMapping;
    }

    public abstract void doCopy();
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy