Slashdot Mirror
Where's the Traveling Salesman for Google Maps?
Komi writes "Has anyone tackled the Traveling Salesman Problem with Google Maps or any other online mapping tool? I've searched, but can't find anything. To me this seems like such an obviously cool function. I'm not up to date on algorithms, so perhaps this isn't really tractable for large values of n. But for small numbers (maybe up to 5), this could at least be brute-forced. I would love to use this when I have errands to run, and I want an overall optimal route. So if this hasn't been done, someone please do it!"
He is out, travelling? Or just too small to be seen in that resolution?
I have no idea.
Well, I haven't heard about any Nobel prizes or Fields medals awarded to Google's employees recently.
So, because of network latency, the best you can do is:
1. run Google queries for n^2 routes for all node pairs
2. solve the Travelling Salesman problem yourself
Because there is no way to go A->B->C faster than A->B + B->C if you want to visit B on the way, asking Google/Yahoo/etc for A->B->C routes is pointless.
Of course, step 2. is left as an exercise to the reader.
The creatures outside looked from Alt-Right to Antifa; but already it was impossible to say which was which.
Holy fuck you Americans are lazy. "Um yeah we can't go hiking around a friggin' national park until we find the Provably Laziest Path." What's next, Yosemite sucks because there's no wifi? No gondola lift to Half Dome? No SUV access on El Cap? Want me to hold your 3oz digicam while you press the button to auto-focus to infinity?