资源列表
traversinggraph
- 图的遍历的实现，文字界面，包含深度遍历和广度遍历两种情况-Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~
jisuanjibolanshi
- 逆波兰式的计算。 输入逆波兰式，目前只支持+-*/^ 加减乘除幂求余这几种运算，输出逆波兰式的值。有兴趣的朋友可以去扩充下功能-Reverse Polish calculator. Enter the Reverse Polish Notation, currently only supports+-*/^ Math remainder these types of computing power, the output value against the Polish. Friends
DIJ
- 迪杰斯特拉算法是数据结构中一实验算法。用vs2008编写,已无错误-Dijkstra algorithm is an experimental algorithm for data structure
stack-
- 数据结构课程作业，用堆栈实现的四则运算，带括号。-Data structure course work, with the stack of the four operations with brackets.
ShortestPathMaze
- 使用广度遍历的方式寻找迷宫中的最短路径。-Traverse using the breadth of the way to find the shortest path maze.
1-1
- 利用弗洛伊德算法求解调度问题中最短路程问题-Freud algorithm using the shortest route scheduling problem
zuoye
- 汉诺塔 算法：将上面的n-1个盘子从A移动到C，B作为辅助； 将最下面的盘子n从A移动到B， 将n-1个盘子从C移动到B，A作为辅助 1. 对一个整形数组设计一个排序算法 .n个元素的实数数组，写出求其最大元素和最小元素的算法-Tower of Hanoi algorithm: the above n-1 a plate moves from A to C, B as an auxiliary n the bottom of the plate moves from A t
5
- 机械优化设计中的复合型法，算法思想简单，比惩罚函数法简便易懂-Mechanical design of multidimensional constrained optimization problem
Huffman
- 哈弗曼树的构建以及哈弗曼编码的实现，采用C语言实现-Huffman code and tree
UMAT-FOR-Non-Isothermal-Elasticity
- UMAT FOR Non-Isothermal Elasticity
RadomData.rar
- 《数据结构》课程中，生成随机数的C++实现。具有很好的参考价值！,The implementation of generation of random data list by C++ programming language.
DP
- 动态分配法解决背包问题，自己设置物品总数,背包总容量-Dynamic allocation method to solve the knapsack problem, the total number of items set up their own backpack with a total capacity