An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity
-
Updated
Sep 24, 2020 - Java
An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity
DepthFirst, BreadthFirst, IterativeDeepening, A*(Tilles out of place, manhattanDistance, chebyshev)
An interactive Voronoi diagram visualizer that demonstrates how Euclidean, Manhattan, and Chebyshev distance metrics partition space through real-time tessellation and growth animation.
Classification using KNN on Vertebral Column Data Set
Grid-based maze pathfinding simulator built in Python; greedy best-first search with Chebyshev distance, 8-directional movement, backtracking, and animated Karel traversal. Stanford Code in Place 2026.
To associate your repository with the chebyshev-distance topic, visit your repo's landing page and select "manage topics."