- 在线时间
- 2 小时
- 最后登录
- 2017-8-7
- 注册时间
- 2010-5-14
- 听众数
- 3
- 收听数
- 0
- 能力
- 0 分
- 体力
- 30 点
- 威望
- 0 点
- 阅读权限
- 20
- 积分
- 10
- 相册
- 0
- 日志
- 0
- 记录
- 0
- 帖子
- 1
- 主题
- 0
- 精华
- 0
- 分享
- 0
- 好友
- 0
升级   5.26% 该用户从未签到 - 自我介绍
- 我学生来学习的我学生来学习的我学生来学习的
|
package org.shirdrn.algorithm.problem;
import java.util.HashMap;
import java.util.Map;
import junit.framework.TestCase;
public class TestKnapsackProblem extends TestCase {
private KnapsackProblem knapsack;
private Map<String, Double> weight;
private Map<String, Double> price;
private Double capacity;
@Override
protected void setUp() throws Exception {
weight = new HashMap<String, Double>();
weight.put("A", 5.00);
weight.put("B", 14.30);
weight.put("C", 1.36);
weight.put("D", 32.55);
weight.put("E", 11.00);
price = new HashMap<String, Double>();
price.put("A", 19.22);
price.put("B", 33.09);
price.put("C", 9.22);
price.put("D", 47.30);
price.put("E", 37.30);
capacity = 26.00;
this.knapsack = new KnapsackProblem(weight, price, capacity);
}
public void testSort() {
this.knapsack.sort();
System.out.println("- After sorting : ");
for(Map.Entry<String, Double> entry : this.knapsack.getRateEntries()) {
System.out.println(entry.getKey() + " : " + entry.getValue());
}
}
public void testKnapsack() {
this.knapsack.sort();
this.knapsack.solve();
System.out.println("- Optimized solution :");
System.out.println(this.knapsack.getOptimized());
System.out.println("- Optimized solution vector :");
System.out.println(this.knapsack.getSolutions());
}
} |
|