搜索资源列表
BinarySearchTree
- 二叉搜索树的各种基本操作,各种遍历的递归和非递归实现,还有输出在指定范围的节点等-Binary search tree, variety of basic operations, a variety of traversal recursive and non-recursive implementation, as well as output in the specified range of nodes, etc.
datastr
- C/C++常用的数据结构类 包括: array.h: 安全数组,可自动增长大小(随机访问,但扩充时效率低) linkedlist.h: 普通链表(可随机访问,但访问效率低) dclinkedlist: 双向循环链表(不可随机访问,但插入、遍历的效率都比普通链表高) hashtable.h: 哈希表(使用键值标识元素,键值一样的元素即认为相等,需重载 == 运算符并由用户定义哈希函数) binstree.h: 二叉搜索树(需重载 == 和 < 运算符) avltr
Searchtree
- 用c语言编写的遍历搜索树的程序,在选择路径问题上可以应用.-Using c language search tree traversal procedures, the choice of the path can be applied to the issue.
AvlTree
- 平衡树:AVL树的是一种平衡的二叉搜索树。每次插入,删除的时候需要一个局部的平衡化操作-Balanced tree: AVL tree is a balanced binary search tree. Each insertion, deletion, when the need for a balance of local operation
vchelper
- VC写的文件搜索器,用到了目录树。目录树代码效率一般。-VC to write a document search engine, use the directory tree. Directory tree code efficiency in general.
BST_path
- 二叉搜索树求每个结点到根节点的路径 非递归的先序,中序,后序遍历-Binary search tree for each node to the root path of the first non-recursive sequence, in order, after the traversal
Rstar_Berchtold.tar
- R*树,具有添加,删除,查询节点功能,是搜索算法中的一种,常用于GIS软件中。-R* tree, with add, delete, query node function, is a search algorithm, commonly used in the GIS software.
Pyramidtree.tar
- 金字塔树,具有添加,删除,查询节点功能,是搜索算法中的一种,常用于GIS软件中。-Pyramid tree, with add, delete, query node function, is a search algorithm, commonly used in the GIS software.
binSearchTree1
- 二叉搜索树的基本操作,可查找插入删除建立的二叉搜索树以广义表给出-Binary search tree s basic operation, can be inserted to find the deletion of the establishment of the binary search tree to table gives a broad sense
orderTree
- 1.编制构建二叉排序树的程序,并使用一组数据进行验证。 2.实现二叉排序树的查找算法,计算一组输入数据的查找长度。 3.编制构建平衡二叉树的程序,计算一组输入数据的查找长度 . 程序执行的命令包括: (1)输入构造二叉搜索树的文件名来构造二叉排序树 (2)输入要进行查找的文件名 (3)由计算机终端显示各个数据的查找长度和总的查找长度、平均查找长度 (4)结束 -1. Preparation of building a binary sort tree procedur
guangdusousuo
- 宽度优先搜索算法(又称广度优先搜索)是最简便的图的搜索算法之一,这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of
BinarySearchTree
- 这个文件提供的C++代码实现的二叉搜索树。这是一种高效的数据结构。非常有参考价值。-The file is about binary search tree.It is implemented with C++ language.This structur is very efficient.
btree
- 数据库的应用,基于索引,实现一个简单的B+树搜索树 -Database application, based on the index, the realization of a simple B+ tree search tree
AVLTree
- 用C实现的AVL搜索树的完整源码,包括插入操作和删除操作的具体实现,以及平衡的调整-AVL with C achieved a complete search tree source code, including the insertion operation and deletion of concrete realization, as well as the adjustment of balance
NineGrid
- 八数码问题的C++程序代码。八数码问题是个典型的状态图搜索问题。搜索方式有两种基本的方式,即树式搜索和线式搜索。搜索策略大体有盲目搜索和启发式搜索两大类。盲目搜索就是无“向导”的搜索,启发式搜索就是有“向导”的搜索。-8 digital issues of C++ program code. Digital 8 is a typical problem of the state map search problems. There are two basic search methods, na
tree
- 主要是针对搜索树,平衡树,伸展树的插入删除,搜索的时间比较,以及操作代码。-Mainly for the search tree, balanced tree, the tree stretch insert delete, search time, as well as the operation code.
B
- b树,用于空间搜索引擎,非常实用,特别好-b tree, for the space search engine, very useful, especially good
bstcnt(1)
- 二叉搜索树(Binary Search Tree)是满足如下性质的二叉树: ①若它的左子树非空,则左子树上所有结点的值均小于根结点的值; ②若它的右子树非空,则右子树上所有结点的值均大于根结点的值; ③左、右子树本身又各是一棵二叉搜索树。-Binary Search Tree (Binary Search Tree) is to meet the nature of the binary tree as follows: ① If its non-empty left subtree
BinaryTree
- 实现二叉树的添加,删除,插入等功能,以及二擦搜索树的查找-binarytree
ThreeColor
- 采用回溯法,利用动态搜索树的数据结构来构造一棵解树,实现3着色问题。 本程序使用迭代回溯算法-The use of retrospective law, the use of dynamic search tree data structure to construct a solution tree, the realization of 3 coloring problem. This procedure backtracking algorithm using iterative