-
DLinkedList
双链表的定义和插入算法，双链表的定义，删除，插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
- 2013-07-17 15:38:38下载
- 积分：1
-
complex
.h文件。c++中的复数类，能够直接完成基本四则运算，输入输出流，完成一定范围内的比较运算(. H file. c++ classes in the plural, to directly perform basic arithmetic, input and output streams, to complete a range of comparison operators)
- 2021-04-25 14:58:46下载
- 积分：1
-
code
各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)
- 2010-06-22 11:11:45下载
- 积分：1
-
hanoi
Hanoi塔问题非递归算法实现，几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)
- 2009-07-13 08:45:51下载
- 积分：1
-
hamidunp2Boulatu
关于中国邮递员的解决办法，个人觉得还不错的说(Chinese postman)
- 2012-06-10 17:28:15下载
- 积分：1
-
SHU
为了点分 求分下载好麻烦 c++二叉排序树(In order to find points dotted download good trouble c++ binary sort tree)
- 2013-07-25 01:35:56下载
- 积分：1
-
data_structure
数据结构c源代码实现，大概有100个左右，基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)
- 2012-07-19 21:43:52下载
- 积分：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
-
string.tar
数据结构课程设计－－实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)
- 2009-11-08 12:20:02下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
