-
DisplayBTree
代码注重B树插入、删除的算法逻辑，适用于
学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )
- 2006-07-19 00:00:38下载
- 积分：1
-
03
说明： 《妙趣横生的算法》第三部分原书附带代码程序，绝对属实(" Algorithm for fun," the third part of the original program with the code, the absolute truth)
- 2011-04-24 01:36:18下载
- 积分：1
-
5100309203_5_8
二叉树类的前序，后序，层次遍历，其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)
- 2012-12-16 14:16:41下载
- 积分：1
-
xianxingbiaolianjie
线性表的链接实现可利用单链表来实现，每个节点存储一个元素。
利用单链表来实现线性表的元素的插入，删除，修改等功能。
(Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
- 2011-04-26 11:57:25下载
- 积分：1
-
chain
链表的模板类,提供插入删除，遍历器，查找等功能，只有一个头文件，可以包含到你的工程(template implemention of Chain)
- 2013-12-09 11:04:33下载
- 积分：1
-
tree
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
- 2013-07-09 13:39:31下载
- 积分：1
-
Lecture7
数据结构中插入排序，堆栈排序等的用法还有希尔排序(Data structure insertion sort, stack, sort, etc. use well sorted Hill)
- 2011-07-27 15:31:31下载
- 积分：1
-
jiaotong
用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
- 2013-03-23 13:06:49下载
- 积分：1
-
C++
说明： 标准答案习题1
1.1 简述C++语言程序的结构特点。
答：
（1）C++程序由一个或多个函数组成，其中至少有一个主函数main()，程序从主函数开始执行，由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)
- 2008-11-25 16:16:27下载
- 积分：1
-
astar
A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0)
2、重复以下步骤:
在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点
把当前节点从开放列表删除, 加入到封闭列表.
(A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
- 2013-04-04 11:06:42下载
- 积分：1
