Dijkstra's algorithm for calculating shortest (least costly) route in a graph. Mirror of https://codeberg.org/sciss/Dijkstra
dijkstra 0.1.0
Group ID:
de.sciss
Artifact ID:
dijkstra_2.12
Version:
0.1.0
Release Date:
Mar 18, 2018
Licenses:
Files:
Full Scala Version:
2.12.4
Developers:
libraryDependencies += "de.sciss" %% "dijkstra" % "0.1.0"
ivy"de.sciss::dijkstra:0.1.0"
//> using dep "de.sciss::dijkstra:0.1.0"
import $ivy.`de.sciss::dijkstra:0.1.0`
<dependency> <groupId>de.sciss</groupId> <artifactId>dijkstra_2.12</artifactId> <version>0.1.0</version> </dependency>
compile group: 'de.sciss', name: 'dijkstra_2.12', version: '0.1.0'