net.automatalib.util.graphs.traversal.BreadthFirstIterator 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-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.traversal;

import java.util.ArrayDeque;
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.Queue;

import net.automatalib.commons.util.mappings.MutableMapping;
import net.automatalib.graphs.IndefiniteGraph;
import net.automatalib.util.traversal.VisitedState;

final class BreadthFirstIterator implements Iterator {

    private final Queue bfsQueue = new ArrayDeque<>();
    private final MutableMapping visited;
    private final IndefiniteGraph graph;

    BreadthFirstIterator(IndefiniteGraph graph, Collection start) {
        this.graph = graph;
        this.visited = graph.createStaticNodeMapping();
        bfsQueue.addAll(start);
    }

    @Override
    public boolean hasNext() {
        return !bfsQueue.isEmpty();
    }

    @Override
    public N next() {
        N result = bfsQueue.poll();
        if (result == null) {
            throw new NoSuchElementException();
        }

        for (E edge : graph.getOutgoingEdges(result)) {
            N tgt = graph.getTarget(edge);
            if (visited.put(tgt, VisitedState.VISITED) != VisitedState.VISITED) {
                bfsQueue.add(tgt);
            }
        }

        return result;
    }

}