Paket: libcneartree-dev (5.1.1+dfsg1-2.1 och andra)
Länkar för libcneartree-dev
Debianresurser:
Hämta källkodspaketet neartree:
- [neartree_5.1.1+dfsg1-2.1.dsc]
- [neartree_5.1.1+dfsg1.orig.tar.gz]
- [neartree_5.1.1+dfsg1-2.1.debian.tar.xz]
Ansvariga:
Externa resurser:
- Hemsida [neartree.sourceforge.net]
Liknande paket:
Library and headers for solving the Nearest Neighbor Problem
Neartree is an API and a library for finding nearest neighbors among points in spaces of arbitrary dimensions. This package provides a C++ template, TNear.h, and C library and header files for compiling programs using Neartree.
The library uses the Nearest Neighbor algorithm after Kalantari and McDonald, (IEEE Transactions on Software Engineering, v. SE-9, pp. 631-634,1983) modified to use recursion instead of a double-linked tree and simplified so that it does less checking for things like is the distance to the right less than the distance to the left; it was found that these checks make little to no difference.
Andra paket besläktade med libcneartree-dev
|
|
|
|
-
- dep: libcneartree7t64 (= 5.1.1+dfsg1-2.1+b1)
- Library for solving the Nearest Neighbor Problem
Hämta libcneartree-dev
Arkitektur | Version | Paketstorlek | Installerad storlek | Filer |
---|---|---|---|---|
amd64 | 5.1.1+dfsg1-2.1+b1 | 81,3 kbyte | 698,0 kbyte | [filförteckning] |
arm64 | 5.1.1+dfsg1-2.1+b1 | 76,4 kbyte | 685,0 kbyte | [filförteckning] |
armel | 5.1.1+dfsg1-2.1+b1 | 77,3 kbyte | 690,0 kbyte | [filförteckning] |
armhf | 5.1.1+dfsg1-2.1+b1 | 73,3 kbyte | 651,0 kbyte | [filförteckning] |
i386 | 5.1.1+dfsg1-2.1+b1 | 81,4 kbyte | 688,0 kbyte | [filförteckning] |
mips64el | 5.1.1+dfsg1-2.1+b1 | 79,9 kbyte | 713,0 kbyte | [filförteckning] |
ppc64el | 5.1.1+dfsg1-2.1+b1 | 84,2 kbyte | 714,0 kbyte | [filförteckning] |
riscv64 | 5.1.1+dfsg1-2.1+b1 | 119,4 kbyte | 1.226,0 kbyte | [filförteckning] |
s390x | 5.1.1+dfsg1-2.1+b1 | 82,3 kbyte | 703,0 kbyte | [filförteckning] |