net.automatalib.util.graphs.traversal.SimpleDFRecord 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-2014 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.traversal;
import java.util.Collection;
import java.util.Iterator;
import net.automatalib.graphs.IndefiniteGraph;
class SimpleDFRecord {
public final N node;
private Iterator extends E> edgeIterator;
public SimpleDFRecord(N node) {
this.node = node;
}
public final boolean wasStarted() {
return (edgeIterator != null);
}
public final boolean start(IndefiniteGraph graph) {
if(edgeIterator != null)
return false;
Collection extends E> outEdges = graph.getOutgoingEdges(node);
this.edgeIterator = outEdges.iterator();
return true;
}
public final boolean hasNextEdge() {
if(edgeIterator == null) {
throw new IllegalStateException("Edge iteration not yet started");
}
return edgeIterator.hasNext();
}
public final E nextEdge() {
if(edgeIterator == null) {
throw new IllegalStateException("Edge iteration not yet started");
}
return edgeIterator.next();
}
}