TSP
O(x^2 2^x)
bit DP
Towns already visited 2^x
Last town visited x
Next town to visit x
Some patterns return to the starting point and some do not.
ABC180E: Back
PAST3M: not back
code:python
def tsp_return(num_vertex, distances):
# ABC180E
INF = 9223372036854775807
SUBSETS = 2 ** num_vertex
memo = [INF * num_vertex for _i in range(SUBSETS)]
memo00 = 0
for subset in range(1, SUBSETS):
for v in range(num_vertex):
for u in range(num_vertex):
mask = 1 << u
if subset & mask:
memosubsetv = min(
memosubsetv,
memosubset ^ masku + distancesuv)
return memo-10
def tsp_not_return(num_vertex, distances, from_start):
# PAST3M
INF = 9223372036854775807
SUBSETS = 2 ** num_vertex
memo = [INF * num_vertex for _i in range(SUBSETS)]
for subset in range(1, SUBSETS):
for v in range(num_vertex): # new vertex
mask = 1 << v
if subset == 1 << v:
# previous vertex is start
memosubsetv = min(
memosubsetv,
from_startv)
elif subset & mask: # new subset includes v
for u in range(num_vertex):
memosubsetv = min(
memosubsetv,
memosubset ^ masku + distancesuv)
return min(memo-1)
---
This page is auto-translated from /nishio/巡回セールスマン問題 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.