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.

LicenseApache 2.0
Tagsautomataalgorithm
DateJun 04, 2015
Filespom (2 KB)  jar (18 KB)  View All
RepositoriesCentralArizona CSIBiblioSciJava PublicXceptance
Ranking#425165 in MvnRepository (See Top Artifacts)

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

Test Dependencies (1)

Category/License Group / ArtifactVersionUpdates
Testing
Apache 2.0
org.testng » testng 6.8.87.11.0

Licenses

LicenseURL
Apache License, Version 2.0 http://www.apache.org/licenses/LICENSE-2.0.txt

Developers

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