Travel & Tourism
Came here for my uni course. Stayed for the flamboyancy
Energetic…. and lots of love for you
TSP is the minimum CIRCUITAL path through the points IT IS NOT the minimum path through the set. It's only the CIRCUITAL part that makes it NP-HARD. There's non NP solutions to minimum path.
which programming language did you use?
Pokemon Go is still a thing
Why not computing greedy algorithm (visiting the closest city…) giving you the upper bound ?
I wonder how you expect someone working on TSP algorithms doesn't know how to swap 2 variables
i know this is late, but i think the travelling salesman problem requires you to go back to your starting location after visiting every city.
informative and funny XD
great stuff! would like to see ant colony simulation for the same problem or event multiple sales doing each multiple visits.
The annoying day Pokémon Go mentions are supposed to kick in is today.
I come from the future to let you know that this is still interesting.
I'm late, but I programmed a solver for this problem for my science fair project here: http://tsp-science-fair.glitch.me
guy from the future here, Pokemon go is still relevant
What this video needs is…. more talking with the arms and hands. 😉 interesting stuff! though a lot flies over my head. You're an enthusiastic teacher.. fun watch.
now in 4th dimension
You can calculate the factorial of number of cities and do the necesary calcs.
Could you please show what's in your index.html so far?
It's more like finding a MST from a graph. Isn't it?
Great video! But tsp requires to return to initial citie
instead of writing 'bestEver = cities.slice();', you can just write 'bestEver = cities;'. It copies the array exactly
!3 = 3 possibility!The Salesman always start from its headquarter.
Thank you for showing on this kind of coding,,,,,,
Your email address will not be published. Required fields are marked *
Save my name, email, and website in this browser for the next time I comment.