File: control

package info (click to toggle)
r-cran-tsp 1.1-6-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster
  • size: 1,128 kB
  • sloc: ansic: 277; sh: 13; makefile: 2
file content (29 lines) | stat: -rw-r--r-- 1,105 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
Source: r-cran-tsp
Maintainer: Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net>
Uploaders: Andreas Tille <tille@debian.org>
Section: gnu-r
Testsuite: autopkgtest-pkg-r
Priority: optional
Build-Depends: debhelper (>= 11~),
               dh-r,
               r-base-dev,
               r-cran-foreach
Standards-Version: 4.1.5
Vcs-Browser: https://salsa.debian.org/r-pkg-team/r-cran-tsp
Vcs-Git: https://salsa.debian.org/r-pkg-team/r-cran-tsp.git
Homepage: https://cran.r-project.org/package=TSP

Package: r-cran-tsp
Architecture: any
Depends: ${R:Depends},
         ${shlibs:Depends},
         ${misc:Depends}
Recommends: ${R:Recommends}
Suggests: ${R:Suggests}
Description: GNU R traveling salesperson problem (TSP)
 Basic infrastructure and some algorithms for the traveling
 salesperson problem (also traveling salesman problem; TSP).
 The package provides some simple algorithms and
 an interface to the Concorde TSP solver and its implementation of the
 Chained-Lin-Kernighan heuristic. The code for Concorde
 itself is not included in the package and has to be obtained separately.