Travelling Salesman Problem solved using Backtracking, and approximation algorithms such as: Triangular Approximation Heuristic, Closest Neighbour Heuristic and our own heuristic! Developed in C++ for the subject: "Design of Algorithms"
Python project for the Fundamentals of of Data Science class for the MSc. in Data Science at the Sapienza University of Rome. The main purpose of the project is practicing Computer Vision concepts and performing Closest Neighbors classification on an image dataset.
Computes closest pairs of points
Add a description, image, and links to the closest-neighbour topic page so that developers can more easily learn about it.
To associate your repository with the closest-neighbour topic, visit your repo's landing page and select "manage topics."