资源列表
1
- 这是一个很优秀的C++ 程序,里面所用的技巧是很巧妙的。-C++ program.this is a very excellent program,you will learn much knowlege.
Simplex
- 单纯形法算法,试过,比较好用,大规模没有验证过,希望有人提出宝贵意见-Simplex method algorithm, tried to compare easy to use, large-scale has not verified the hope that it was valuable advice
czsjf
- 1、本程序实现计算任意长的整数的加法运算. 以用户和计算机对话的方式,即在计算机终端上显示“提示信息”之后,由用户在键盘上输入演示程序中规定的运算命令,然后程序就计算并显示出这两个数的运算。 2、本演示程序中,集合的元素限定为数字字符[‘0’~’9’]和字符‘,’与‘;’,输入字符可以任意长,输入形式以“回车符”为结束标志,串中字符顺序不限,且允许出现重复字符。 3、利用双向循环链表现实长整数的存储,每个结点含一个整形变量。输入的形式以回车结束,可以直接输入正数或负数。按中国对于长整数
tree
- implementation of tree and postorder method
DS2
- 使用STL queue adapter,实现队列先入先出。通过.run文件中的内容,实现相应的输出。-Using the STL queue adapter, to achieve queue FIFO. Through. Run the contents of the document to achieve a corresponding output.
exercise4
- 通过构造树,实现对hospital各部分之间数目关系的表示。通过在part类里定义子类实现part之间的关联,从而最终实现通过读取相应文字而输出相对应的结果。-By constructing a tree, to realize the number of relationships between the various parts of hosptal representation. By the definition of sub-part class where the associat
exercise5
- 主要解决一个在旅行过程中的费用问题,关键是利用Dijkstra算法求解欧洲两个城市之间的最便宜的乘车路线,并把最短花费、路径的距离以及过的城市显示出来。-Is mainly to solve a process of in travel costs, the key is to use Dijkstra algorithm to solve Europe between the two cities the cheapest travel routes, and to take the shor
111
- 英文文件的字母数字统计 可根据不同的文件进行统计-Letters in English file statistics according to different statistics documents
1
- 基于最小生成树的Steiner最小树生成算法-Based on Minimum Spanning Tree Algorithm for Steiner minimum spanning tree
11
- 一种度约束最小生成树算法-Degree-constrained minimum spanning tree algorithm
11
- ... ...破圈法构造最小生成树算法探讨.rar-Broken circle method of constructing the minimum spanning tree algorithm is explored. Rar
sort
- 产生十个随机数并组成数组,然后进行快速排序和归并排序-Generate 10 random numbers and form an array, and then a quick sort and merge sort