An implementation of the Lin-Kernighan heuristics algorithm for the (symmetric) traveling salesman problem (TSP). Mirror of https://codeberg.org/sciss/LinKernighanTSP
linkernighantsp 0.1.2
Group ID:
de.sciss
Artifact ID:
linkernighantsp_2.13
Version:
0.1.2
Release Date:
Jun 19, 2020
Licenses:
Files:
Full Scala Version:
2.13.2
Developers:
libraryDependencies += "de.sciss" %% "linkernighantsp" % "0.1.2"
ivy"de.sciss::linkernighantsp:0.1.2"
//> using dep "de.sciss::linkernighantsp:0.1.2"
import $ivy.`de.sciss::linkernighantsp:0.1.2`
<dependency> <groupId>de.sciss</groupId> <artifactId>linkernighantsp_2.13</artifactId> <version>0.1.2</version> </dependency>
compile group: 'de.sciss', name: 'linkernighantsp_2.13', version: '0.1.2'