- Animate the solution to the traveling salesperson problem with Held-Karp, which uses bitmask dynamic programming to find an exact solution.
- Compare this to a quick approximation found by the nearest neighbor heuristic.
- Allow users to manually solve the problem themselves.
- Change the animation speed with a dial.
- Randomly sample cities from around the world.
- Or add your own cities.
- Visualize the world and paths on a 2d map or 3d globe with Cesium.
forked from MaximilianMeiler/3530-Proj3
-
Notifications
You must be signed in to change notification settings - Fork 0
Compare Held-Karp and Nearest Neighbor solutions to the traveling salesperson problem
blahnikkai/optimal-odyssey
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Compare Held-Karp and Nearest Neighbor solutions to the traveling salesperson problem
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- JavaScript 79.3%
- CSS 19.6%
- HTML 1.1%