Algorithm
Development Kit 1.0

Package algs.model.problems.nearestNeighbor

Defines the Brute Force Nearest Neighbor implementation to be used as a benchmark when comparing the kd-tree implementation.

See:
          Description

Class Summary
BruteForceNearestNeighbor Brute Force implementation of Nearest Neighbor Query.
 

Package algs.model.problems.nearestNeighbor Description

Defines the Brute Force Nearest Neighbor implementation to be used as a benchmark when comparing the kd-tree implementation.


Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.