|
| 1 | +# o p t K n a p s a c k . p y |
| 2 | +# |
| 3 | +# Chris Meyers. 09/25/2013 |
| 4 | +# |
| 5 | +from htmlFrame import HtmlFrame |
| 6 | +from matrix import Matrix |
| 7 | + |
| 8 | +maxwgt = 10 |
| 9 | +vals = [0,10,40,30,50] |
| 10 | +wgts = [0, 5, 4, 6, 3] |
| 11 | + |
| 12 | +htmlPage = HtmlFrame() |
| 13 | +htmlPage.banner = "Knapsack Problem" |
| 14 | +headers=['wt'+str(i) for i in range(maxwgt+1)] |
| 15 | + |
| 16 | +inp = Matrix(len(vals),3) |
| 17 | +inp.title = "Sack holds weight %s" % maxwgt |
| 18 | +inp.dftFormat = "<pre>%03s</pre>" |
| 19 | +inp.tableAttr = 'border="1" cellspacing="0" cellpadding="4"', |
| 20 | +inp.tableHeaders=['Item #','Weight','Value'] |
| 21 | +for i in range(len(vals)) : |
| 22 | + inp.setrowVals(i, [i, wgts[i], vals[i]]) |
| 23 | + |
| 24 | +frame = Matrix(1,2) |
| 25 | +frame[0,0] = inp.renderHtml() |
| 26 | +nItems = len(vals) |
| 27 | +best = Matrix(nItems,maxwgt+1) |
| 28 | +best.dftFormat = "<pre>%03s</pre>" |
| 29 | + |
| 30 | +for i in range(1,nItems) : |
| 31 | + best.setrowVal(i,0) |
| 32 | +for i in range(1,nItems) : |
| 33 | + for w in range(0,maxwgt+1) : |
| 34 | + remBest = best[i-1,w-wgts[i]] |
| 35 | + if remBest == None : remBest = 0 |
| 36 | + newSolution = vals[i]+remBest |
| 37 | + if ((wgts[i] <= w and newSolution > best[i-1,w])) : |
| 38 | + best[i,w] = newSolution |
| 39 | + best.style[i,w] = "background-color:pink" |
| 40 | + best.title = "Optimal solution for weight %s includes item %s" % (w,i) |
| 41 | + best.tableAttr='border="1" cellspacing="0" cellpadding="4"' |
| 42 | + best.tableHeaders=headers |
| 43 | + frame[0,1] = best.renderHtml() |
| 44 | + htmlPage.item1 = frame.renderHtml() |
| 45 | + htmlPage.makeFrame() #break |
| 46 | + else : |
| 47 | + best[i,w] = best[i-1,w] |
0 commit comments