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

net.automatalib.incremental.mealy.tree.AnnotatedEdge Maven / Gradle / Ivy

Go to download

A library for incremental automata construction. This artifact contains algorithms for incrementally constructing DFAs (prefix-closed and non-prefix-closed), Mealy machines, and Moore machines from a finite, incrementally growing set of example inputs/outputs.

There is a newer version: 0.11.0
Show newest version
package net.automatalib.incremental.mealy.tree;

public final class AnnotatedEdge {
	private final Edge edge;
	private final I input;
	
	public AnnotatedEdge(Edge edge, I input) {
		this.edge = edge;
		this.input = input;
	}
	
	public Edge getEdge() {
		return edge;
	}
	
	public I getInput() {
		return input;
	}
	
	public O getOutput() {
		return edge.getOutput();
	}
	
	public Node getTarget() {
		return edge.getTarget();
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy