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

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


class DFRecord extends SimpleDFRecord {
	
	public static class LastEdge {
		public final E edge;
		public final N node;
		public final D data;
		
		public LastEdge(E edge, N node, D data) {
			this.edge = edge;
			this.node = node;
			this.data = data;
		}
	}
	
	public final D data;
	private LastEdge lastEdge;
	
	public DFRecord(N node, D data) {
		super(node);
		this.data = data;
	}
	
	public D getData() {
		return data;
	}

	public LastEdge getLastEdge() {
		LastEdge result = lastEdge;
		lastEdge = null;
		return result;
	}
	
	public void setLastEdge(E edge, N tgtNode, D tgtData) {
		assert lastEdge == null;
		lastEdge = new LastEdge<>(edge, tgtNode, tgtData);
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy