Travelling Salesman Problem - Nearest Neighbour Algorithm
A web application to solve the Travelling Salesman Problem using the Nearest Neighbour Algorithm, with a visual representation of the algorithm's steps.
This project implements the Nearest Neighbour Algorithm to solve the classic Traveling Salesman Problem (TSP). The application is built with a Flask backend that handles the computational logic, while HTMX provides dynamic frontend updates without complex JavaScript frameworks.
The algorithm visualization shows step-by-step path construction, helping users understand how the nearest neighbor heuristic works. The implementation includes: dynamic route calculation, interactive map visualization, performance metrics for different dataset sizes, and comparison with optimal solutions where possible. The project demonstrates practical application of algorithmic concepts in a web environment.