python
Je_Ho
这个作者很懒,什么都没留下…
展开
-
最优分解问题
def fun(nn): a = [float('0') * 100 for _ in range(100)] # 保存分解后的数 b = [] k = 1 sum = 1 a[1] = 2 nn = nn - 2 while nn > a[k]: k += 1 a[k] = a[k - 1] + 1...原创 2018-12-07 16:05:43 · 230 阅读 · 0 评论 -
分支限界法---旅行售货员问题
N: int = 4MAX_WEIGHT: int = 4000NO_PATH: int = -1City_Graph = [[int('0')] * (N+1) for _ in range(N+1)] # 初始化dpx = [int('0') * (N+1) for _ in range(N+1)] # 保存第i步便利的城市isIn = [int('0') * (N+1) fo...原创 2018-12-21 15:12:48 · 2774 阅读 · 0 评论