Artifacts using automata-api version 0.3.1-ase2013-tutorial

A collection of examples of how to use LearnLib

A collection of various small example applications that illustrate several use cases of AutomataLib.<br /> <em>Note:</em> This artifact is not intended as a library, but only exists for educational purposes.

This artifact contains several miscellaneous, well-known algorithms, which however are rather specific in their concrete use case and therefore not fit for the AutomataLib Utilities library. Examples include Dijkstra's algorithm for the SSSP problem, the Floyd-Warshall algorithm for the APSP problem and Tarjan's algorithm for finding all strongly-connected components in a graph.