8000 GitHub - Baka9k/TSP: Travelling salesman problem bruteforce solution
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Baka9k/TSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

45 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Travelling salesman problem bruteforce solution

Shows draggable grid, where user can place dots and move them. After clicking on Calculate button calculates shortest possible route that visits each dot exactly once.

Uses code from the project dots.

##How to use: Click on canvas to place dot, move dots with mouse, use Random tool (Random button in bottom right corner or R on keyboard) to place 5 dots randomly. Press Calculate button (or C on keyboard) to calculate route.

##Live demo: https://baka9k.github.io/TSP/

##Screenshots: Screenshot 1 Screenshot 2 Screenshot 3 Screenshot 4

About

Travelling salesman problem bruteforce solution

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published
0