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.3
Group ID:
de.sciss
Artifact ID:
linkernighantsp_3
Version:
0.1.3
Version Scheme:
Release Date:
Jul 22, 2021
Licenses:
Files:
Full Scala Version:
3.0.1
Developers:
libraryDependencies += "de.sciss" %% "linkernighantsp" % "0.1.3"
ivy"de.sciss::linkernighantsp:0.1.3"
//> using dep "de.sciss::linkernighantsp:0.1.3"
import $ivy.`de.sciss::linkernighantsp:0.1.3`
<dependency> <groupId>de.sciss</groupId> <artifactId>linkernighantsp_3</artifactId> <version>0.1.3</version> </dependency>
compile group: 'de.sciss', name: 'linkernighantsp_3', version: '0.1.3'
