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

net.automatalib.graphs.base.compact.CompactSimpleBidiGraph Maven / Gradle / Ivy

Go to download

The core artifact of AutomataLib. This library contains concrete implementations for many of the automaton model interfaces defined in the API artifact, as well as abstract base classes that facilitate implementing new automaton model classes. Note that concrete algorithms (traversal, reachability analysis etc.) are not in the scope of this artifact.

There is a newer version: 0.11.0
Show newest version
/* Copyright (C) 2013-2018 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.graphs.base.compact;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;

import net.automatalib.commons.util.array.ResizingObjectArray;
import net.automatalib.graphs.BidirectionalGraph;

public class CompactSimpleBidiGraph extends AbstractCompactSimpleGraph, EP>
        implements BidirectionalGraph> {

    private final ResizingObjectArray inEdges;

    public CompactSimpleBidiGraph() {
        this.inEdges = new ResizingObjectArray();
    }

    public CompactSimpleBidiGraph(int initialCapacity) {
        super(initialCapacity);
        this.inEdges = new ResizingObjectArray(initialCapacity);
    }

    @Override
    public Collection> getIncomingEdges(Integer node) {
        return getIncomingEdges(node.intValue());
    }

    public Collection> getIncomingEdges(int node) {
        List> inEdges = getInEdgeList(node);
        return Collections.unmodifiableCollection(inEdges);
    }

    @SuppressWarnings("unchecked")
    protected List> getInEdgeList(int node) {
        return (List>) inEdges.array[node];
    }

    @Override
    public Integer getSource(CompactBidiEdge edge) {
        return Integer.valueOf(getIntSource(edge));
    }

    public int getIntSource(CompactBidiEdge edge) {
        return edge.getSource();
    }

    @Override
    public int addIntNode(Void properties) {
        inEdges.ensureCapacity(size + 1);
        int node = super.addIntNode(properties);
        inEdges.array[node] = new ArrayList>();
        return node;
    }

    @Override
    public CompactBidiEdge connect(int source, int target, EP property) {
        CompactBidiEdge edge = super.connect(source, target, property);
        List> inEdges = getInEdgeList(source);
        edge.inIndex = inEdges.size();
        inEdges.add(edge);
        return edge;
    }

    @Override
    protected CompactBidiEdge createEdge(int source, int target, EP property) {
        return new CompactBidiEdge<>(source, target, property);
    }

}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy