-
PRIM
PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)
- 2009-01-11 19:05:21下载
- 积分：1
-
zhaose
本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)
- 2013-09-23 16:04:24下载
- 积分：1
-
Fa_Pai
关于随机发牌算法的小程序，作为数据结构的大作业，开发环境是VC(Random licensing algorithm for small procedures, as big job data structures, the development environment is VC)
- 2014-10-16 17:54:20下载
- 积分：1
-
fml
已知二叉树的先序遍历结果，建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)
- 2015-02-15 15:20:26下载
- 积分：1
-
KMP
说明： KMP算法的具体实现，能够在O(n+m)时间内找出字串在父串中的位置，n为父串长度，m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)
- 2010-04-28 16:18:00下载
- 积分：1
-
sort
数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)
- 2008-06-14 20:52:24下载
- 积分：1
-
expression
利用栈完成算术表达式求值：从键盘或文件中输入算术表达式，计算其结果并显示。要求处理过程为：（1）转换为后缀表达式并输出；（2）对后缀表达式求值并输出。
输入的表达式中可以有整数、实数、括号，运算符包括+、-、*、/、#（代表单目负）。可以多次输入不同的表达式进行计算，直到用户选择“退出”。栈的基本操作可以自己实现，也可以使用系统提供的STL实现。
(Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
- 2011-10-30 14:14:01下载
- 积分：1
-
fast_sort
/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边，
*基准值为一组，这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high，即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分：1
-
0908030206xin
一、 地理数据文件应用
对由点、线、面构成的地理数据文件进行打开、读取、关闭操作。
要求：
1、在C++环境下，通过程序设计实现文本格式数据文件的操作；
2、在打开数据文件后，生成点、线、面三个链表，分别用于记录三种类型的数据。
3、数据文件结构说明
(Geographic data file applications by point, line, surface consisting of geographic data file open, read, and close operations. Requirements: in C++ environment, through the program design text format data file operations 2, open the data file, generate points, lines, surfaces three linked list, respectively, for the record three types of data. 3, a data file structure)
- 2012-09-14 20:33:26下载
- 积分：1
-
Fund6-StringViewer
字符串，实现了文件中查找想要的字符串，并将其标记出来
- 2010-12-26 20:51:45下载
- 积分：1
