/Travelling-Salesman-Problem

This is a web application that utilizes branch-and-bound and Nearest-Neighbor algorithms for tackling the Travelling Salesman Problem, a challenging NP-Hard problem.

Primary LanguageHTML

Stargazers