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.

LicenseLGPL 3.0
Tagsautomataalgorithm
DateJan 15, 2015
Filespom (2 KB)  jar (17 KB)  View All
RepositoriesCentralArizona CSIBiblioXceptance
Ranking#863843 in MvnRepository (See Top Artifacts)

Note: There is a new version for this artifact

New Version0.6.0

Scope:
Scope:
Format:
Scope:
Scope:
Scope:
Scope:
Scope:
Scope:

Licenses

LicenseURL
GNU LESSER GENERAL PUBLIC LICENSE Version 3, 29 June 2007 http://www.gnu.org/licenses/lgpl-3.0-standalone.html

Developers

NameEmailDev IdRolesOrganization
Malte Isbernermalte.isberner<at>gmail.commisbernerDeveloperTU Dortmund, Chair for Programming Systems