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

de.uni.freiburg.iig.telematik.jagal.ts.labeled.TSComplexity Maven / Gradle / Ivy

Go to download

JAGAL provides implementations for directed graphs (weighted and unweighted) and various types of transition systems as well as utils for graph traversal and modification.

The newest version!
package de.uni.freiburg.iig.telematik.jagal.ts.labeled;

import java.io.Serializable;

public class TSComplexity implements Serializable {
	
	private static final long serialVersionUID = 2341126394227035338L;

	private static final String complexityFormat = "|S| = %s, |E| = %s, |T| = %s";

	public int numStates = -1;
	public int numEvents = -1;
	public int numTransitions = -1;
	
	public TSComplexity(int numStates, int numEvents, int numTransitions) {
		super();
		this.numStates = numStates;
		this.numEvents = numEvents;
		this.numTransitions = numTransitions;
	}
	
	@Override
	public String toString(){
		return String.format(complexityFormat, numStates, numEvents, numTransitions);
	}
	
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy