资源列表
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
PopAndPushDemo
- 模拟堆栈进栈和出栈操作的两个C++源程序-simulated stack into stacks and stacks up operation two C source
longbeigejifen
- 用c++编写的龙贝格积分的程序 附有实例和计算结果
rader7
- FPGA实现DFT快速算法-FPGA DFT Fast Algorithm
Prim
- Prim算法，包括详细的容错机制，且可对非连通情况做处理。-Prim algorithm, including detailed fault-tolerant mechanism, and can be done to deal with the situation of non-connectivity.
Match
- 对任意文本进行括号匹配，提示错误行数和列数。-For any matching text in brackets, indicating the error number of rows and columns.
BiTree
- 我自己做的一个二叉树，供大家来参考，有什么不足的地方请自行改正-I do a binary tree for everyone to reference, what deficiencies to correct your own
BinaryTree
- 二叉树的基本实现（前序中序构造，后序中序构造，前序中序后序遍历）-The basic binary tree implementation (pre-order in the order structure, sequence after sequence of construction, pre-order in the post-order traversal order)
BurgersF90
- 在计算流体力学中很有用，用于求解BURGERS方程的结果！-solve burgers equation!
The-Poly
- 内容为用起泡排序法实现元素的非递减排列.构造一颗二叉排序树并实现其中元素的插入和删除。即先输入一串数据（int型），使计算机构造出一棵二叉排序树（限于C语言的表达，咱不在屏幕上使其输出）。然后按照屏幕提示，删除一个已有的数据，再构成一个新的二叉排序树。-Construct a binary sort tree and which elements insertions and deletions.To enter a string of data (int type), the computer
learnnew
- matlab评分矩阵预测，PVC算法，根据已有的评分数据，预测未知的评分数据-matlab scoring matrix prediction, PVC algorithm, based on the existing rating data to predict unknown ratings data
PFC颗粒生成程序
- PFC中对于砂土的模拟，其颗粒级配尤其重要，该程序能够根据特定级配生成砂土材料