Okay, this term appears nowhere on the Googles, so I'm defining it now: if you have a set of 2d paths and you want to find the shortest path that traverses all of those, you're trying to solve the Tunneling Salesman Problem. I'm officially using that term from now on.
-
-
Only for closed paths. For open paths (which can be entered from either side, but always lead to a different point than they started at) it's a different problem, just related
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.