2016年6月7日
Greedy alogorithoms---single source shortest path
p=[[1000,10, 1000, 30, 100], [1000,1000,50, 1000,1000], [1000,1000,1000,1000,10], [1000,1000,20, 1000,60], [1000,1000,1000,1000,1000]] dist=[0,0,0,0,0 Read More
posted @ 2016-06-07 19:24 zhaodonglin Views(168) Comments(0) Diggs(0)
Greedy Algorithoms--box
weight=[20,10,26,15]_list = zip(weight, range(0, len(weight)))capacity =70 _list.sort(key=lambda item:item[0])print _list_list_load = []def load(item) Read More
posted @ 2016-06-07 08:37 zhaodonglin Views(127) Comments(0) Diggs(0)
Greedy Algorithoms---knapback
from __future__ import division weight = [10,20,30]volume =[60,100,120]kept = [0,0,0]M = 50def knapback(M, weight, volume, kept): for i in range(0,3): Read More
posted @ 2016-06-07 08:36 zhaodonglin Views(133) Comments(0) Diggs(0)
Greedy algorithoms--activity
n=5s = [1,3,0,5,3,5,6,8,8,2,12]f = [4,5,6,7,8,9,10,11,12,13,14]a =[False, False, False, False, False, False, False, False, False, False, False ]_list Read More
posted @ 2016-06-07 08:35 zhaodonglin Views(154) Comments(0) Diggs(0)