|File Search||Catalog||Content Search|
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.
NearTree Release 3.1.1 23 April 2011 (revised 27 September 2011) (c) Copyright 2001, 2008, 2009, 2010, 2011 Larry Andrews. All rights reserved based on Larry Andrews, "A template for the nearest neighbor problem", C/C++ Users Journal, Volume 19 , Issue 11 (Novem more»
neartree (3.1.1-1) unstable; urgency=low * New upstream version. * control: Upgrade to standards-version 3.9.2. * copyright: Fix DEP5 format URL to please lintian. Update years. -- Teemu Ikonen <email@example.com> Wed, 28 Sep 2011 12:55:19 +0200 neartree (3.0.1-1) unstable; urgency=low * New upstream version. * Update binary package names to the new soname (5). * control: - more»
Format: http://anonscm.debian.org/viewvc/dep/web/deps/dep5.mdwn?revision=174 Upstream-Name: NearTree Upstream-Contact: Herbert J. Bernstein Source: http://sourceforge.net/projects/neartree/ Copyright: 2001, 2008, 2009, 2010, 2011 Larry Andrews License: LGPL-2.1+ On Debian systems the full text of the GNU Lesser General Public License, version 2.1 can be found in the `/usr/share/common-licenses/ more»