is not current version
Last Version 0.6.0

net.automatalib:automata-misc-algorithms 0.5.1

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.

Categories

Categories

Net Auto Application Layer Libs Code Generators
GroupId

GroupId

net.automatalib
ArtifactId

ArtifactId

automata-misc-algorithms
Version

Version

0.5.1
Type

Type

jar

Download automata-misc-algorithms 0.5.1


<!-- https://jarcasting.com/artifacts/net.automatalib/automata-misc-algorithms/ -->
<dependency>
    <groupId>net.automatalib</groupId>
    <artifactId>automata-misc-algorithms</artifactId>
    <version>0.5.1</version>
</dependency>
// https://jarcasting.com/artifacts/net.automatalib/automata-misc-algorithms/
implementation 'net.automatalib:automata-misc-algorithms:0.5.1'
// https://jarcasting.com/artifacts/net.automatalib/automata-misc-algorithms/
implementation ("net.automatalib:automata-misc-algorithms:0.5.1")
'net.automatalib:automata-misc-algorithms:jar:0.5.1'
<dependency org="net.automatalib" name="automata-misc-algorithms" rev="0.5.1">
  <artifact name="automata-misc-algorithms" type="jar" />
</dependency>
@Grapes(
@Grab(group='net.automatalib', module='automata-misc-algorithms', version='0.5.1')
)
libraryDependencies += "net.automatalib" % "automata-misc-algorithms" % "0.5.1"
[net.automatalib/automata-misc-algorithms "0.5.1"]