Common parent metaproject for various miscellaneous additions (algorithms, automaton types) to AutomataLib, which are rather specific in their respective use case.
This project has declared the following modules:
Name | Description |
---|---|
AutomataLib :: Misc :: Incremental | A library for incremental automata construction. This artifact contains algorithms for incrementally constructing DFAs (both prefix-closed and non-prefix-closed) and Mealy machines from a finite, incrementally growing set of example inputs/outputs. |
AutomataLib :: Misc :: Misc. Algorithms | 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. |