资源列表
a
- 0—1背包问题描述如下： 给定m种物品和一背包。物品i的重量是w[i]，其价值为v[i]，背包的容量是c，问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。(每种物品只能选择放入0/1次背包）-0-1 knapsack problem described as follows: given m types of items and a backpack. Item i of the weight of w [i], a value of v [i], the capacity
bridge
- java 实现 网桥功能的模拟 包括自学习功能和转发功能-moot bridge
struts2
- struts2帮助文档，可以方便查看源代码-the help document of struts2
jxse-lib-2.5
- jxse是JXTA所使用的jar包和JDK 5.0支持运行。 包含有ID，服务，查询，管道等-jxse is used by the JXTA jar package and support for JDK 5.0 to run. Contains the ID, service, query, pipelines
project1
- java小实验，一个咖啡管理系统的第一个简易版本-java small experiment, a coffee management system for a simple version of the first
projiect2
- java小实验，一个咖啡管理系统的第一个简易版本-java small experiment, a coffee management system for a simple version of the first
projiect3
- java小实验，一个咖啡管理系统的第一个简易版本-java small experiment, a coffee management system for a simple version of the first
java
- java小实验，一个咖啡管理系统的第一个简易版本-java small experiment, a coffee management system for a simple version of the first
zhanglise08
- DODGAME 3D game mobile J2-DODGAME 3D game mobile J2EE
05130046_05130085_05130143
- JAVA Encrypt and Decrypt Security
MedicalStoreBilling
- Medical Store Billing Java Swing
src
- web shop in java (jsp) with hibernate