https://github.com/axel-jalonen/tsp.axelj.dev

A simple implementation of a nearest neighbours greedy algorithm to provide an answer to the travelling salesman problem.
https://github.com/axel-jalonen/tsp.axelj.dev

algorithms canvas canvas2d recursion travelling-salesman-problem

Last synced: 5 days ago
JSON representation

A simple implementation of a nearest neighbours greedy algorithm to provide an answer to the travelling salesman problem.

• Host: GitHub
• URL: https://github.com/axel-jalonen/tsp.axelj.dev
• Owner: Axel-Jalonen
• Created: 2024-01-11T20:16:45.000Z (about 1 year ago)
• Default Branch: master
• Last Pushed: 2024-11-17T21:14:47.000Z (2 months ago)
• Last Synced: 2024-11-17T22:20:09.244Z (2 months ago)
• Topics: algorithms, canvas, canvas2d, recursion, travelling-salesman-problem
• Language: JavaScript
• Homepage: https://tsp.axelj.dev
• Size: 27.3 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# RT-TSP

_(Real time traveling salesman problem)_

A simple implementation of a nearest neighbours algorithm that runs real time in the browser using HTML canvas2d and a recursive function in JS. Everything is local.