搜索资源列表
NguiBag
- 做一个Ngui的背包，可以拖拽，可以移动，可以交换位置，可以存放物品-Do a Ngui backpack, can drag and drop, can move, can exchange position, can store items
bagpack
- 背包问题 实现背包内物品价值最大化 运用队列的方法-Backpack knapsack problem to maximize the value of goods
backpack
- 通过vc6.0实现背包问题的基本操作，使用了回溯法并用了回归方程-Knapsack problem by vc6.0 achieve the basic operation, using the backtracking with the regression equation
Knapsack-problem
- 假设有一个能装入总重量为T的背包和n 件重量分别为W1，W2,W3,...,Wn的物品。编写算法从n件物品中挑选若干件恰好装满背包，即使得Wi1+Wi2+...+Win=T.(W旁边的字符皆为角标)。要求找出满足条件的所有解。-Suppose there is a load of T of the total weight of W1, N, W2, W3, Wn. Algorithm is compiled n items selected several pieces just loade
adafruit-led-backpack
- HT16K33 驱动四位八段数码管例程.可以连续显示0 1 2 3 4 5 6 7 8 9 字符。-HT16K33 drive four eight digital control routines can be continuously displayed 0,123,456,789 characters.
tuihuo
- 退火算法关于背包问题的应用。计算背包内物品的价值和体重-Annealing algorithm about the application of knapsack problem. Calculate the value of the item in the backpack and weight
BEIBAO
- 给定空间和时间，要求将特定设备的配置最佳化，这就用到了“背包”算法-A given space and time, require that the specific device configuration optimization, it is used to backpack algorithm
backpack
- 给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高-Given a set of items, each item has its own weight and price, within a limited total weight, what we choose to make the total price of the highest items
RocketMouse_PartOne_Final
- Unity 4.3发布后，开发者不再需要使用第三方库或者创建自己的解决方案来构建2D游戏了。现在可以使用一个即视即用的2D工具集来进行开发。结合这些标准统一的工具，开发Unity2D游戏不再是一个痛苦的过程，变成一个富有乐趣的工作了:] 在这个教程中，你将要做一些同样有趣的事。这个游戏没有用疯狂的或者乱飞舞翅膀的小鸟作为角色，而是一个穿喷气背包的小飞鼠。你能猜到这是什么样的游戏么(提示:本教程的标题)？ 对，就是疯狂喷气机(Jetpack Joyride).此处来点掌声。-A
floyd-knapsack
- floyd knapsack Floyd-Warshall算法（Floyd-Warshall algorithm）是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。Floyd-Warshall算法的时间复杂度为O(N3)，空间复杂度为O(N2)。 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总
Backtracking-0-1
- 0-1背包问题的回溯法求解,0-1背包是在M件物品取出若干件放在空间为W的背包里，求出获得最大价值的方案。算法设计 回溯的思想。-Backtracking 0-1 knapsack problem solving 0-1 knapsack is removed in several pieces on items M space W backpack, determined to get the maximum value of the program. Backtracking algorit
Scripts
- 本人基于Unity3D独立编写的一款ARPG游戏源码，内容包括小地图、背包、技能释放、任务、角色信息、UI界面和怪物AI等等。内有详细注释，- It based Unity3D independently created a ARPG game source code, including a small map, backpack, release skills, tasks, role information, UI interface and the monster AI and so
qt3
- 这是关于01背包的动态规划算法，给予python3.5,由于课程设计需要，还实现了可视化界面pyqt-This is a dynamic programming algorithm on 01 backpack, giving python3.5, since the curriculum design needs, but also to achieve a visual interface pyqt
backpack
- 适合解决单背包问题，内涵主程序和调用主程序的格式以及测试文件-Suitable single knapsack problem solving, as well as the test file format connotation main program and call the main program
01packageProblem
- 经典的0-1背包算法，采用动态规划法。n个重量不同，价值不等的物品，放入一个承重量固定的背包中，单个物品不能拆分，求最大价值的组合。- Classic 0-1 knapsack algorithm, using dynamic programming method. N weight is different, the value of items, into a fixed weight of the backpack, a single item can not be split,
backtrackng
- 给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品，使得装入背包中物品的总价值最大。-Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of i
BranchAndBound-master
- Branch and bound method to solve the backpack problem
knapsack_genetic_algorithm-master
- Branch and bound method to solve the backpack problem
源代码
- 此代码主要可登录，查看背包，装备升级以及装备熔炼(This code can log on to see the backpack, equipment upgrades and equipment smelting)
PSO for 3 Models
- 粒子群算法对解决二次规划、旅行商问题、背包问题等源程序(Particle swarm algorithm to solve the secondary planning, traveler problems, backpack problems and other source code)