搜索资源列表
UDS
- UDS Oa 用 vs2008重新编译, 替换了里面的 tree和一些不再支持的控件. 不过不知道是原始文件的问题还是升级造成的,有些功能不太正常. 只包含网站,数据库,文档等请自己搜索-UDS Oa recompiled to use vs2008 to replace the inside of the tree and some of the controls is no longer supported. But do not know the original documen
C
- 本文档容括了C(C++)所有算法,分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorit
src
- PKU中一些数据结构基本算法题的java实现,包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, colle
datastr
- C/C++常用的数据结构类 包括: array.h: 安全数组,可自动增长大小(随机访问,但扩充时效率低) linkedlist.h: 普通链表(可随机访问,但访问效率低) dclinkedlist: 双向循环链表(不可随机访问,但插入、遍历的效率都比普通链表高) hashtable.h: 哈希表(使用键值标识元素,键值一样的元素即认为相等,需重载 == 运算符并由用户定义哈希函数) binstree.h: 二叉搜索树(需重载 == 和 < 运算符) avltr
avl
- avl树的插入删除操作,并包括判断输入的二叉查找树是否为avl树,以及把二叉查找树转换为avl树-AVL tree insertion deletion, and includes judgments entered binary search tree for the AVL tree, and the binary search tree is converted to AVL tree
rb-tree
- 实现了rb-tree的演示和搜索,可以用于日常算法的学习之用-Rb-tree to achieve a demonstration and a search algorithm can be used for day-to-day learning
sift-1.1.1_20071108_win
- Rob Hess的SIFT算法的C语言实现(基于OpenCV),金字塔采样和高斯差分提取特征点,K-D树寻找同名点,RANSAC去粗差-Rob Hess of the SIFT algorithm C language (based on OpenCV), sampling and Gaussian pyramid differential extraction of feature points, KD tree search for points of the same name, RANS
Searchtree
- 用c语言编写的遍历搜索树的程序,在选择路径问题上可以应用.-Using c language search tree traversal procedures, the choice of the path can be applied to the issue.
treelinkedlist
- 本程序的实现是要实现二叉查找树的内容,实现二叉查找树的插入好删除,查找等工作,让我们可以轻松的实现二叉查找树-This procedure is to achieve the realization of binary search tree of content, the realization of binary search tree insertion deletion good to find work so that we can easily achieve the binary
AvlTree
- 平衡树:AVL树的是一种平衡的二叉搜索树。每次插入,删除的时候需要一个局部的平衡化操作-Balanced tree: AVL tree is a balanced binary search tree. Each insertion, deletion, when the need for a balance of local operation
LinkedBinTree
- 数据结构二叉树的功能实现, 比如在二叉搜索树上查找或者删除一个结点。-Binary tree data structure to achieve the function, for example, in binary search tree to find or delete a node.
rtree
- R-tree用于索引多维数据对象,利用数据对象间的相对位置建立最小边界矩形(MBR),可在此结构上完成高效查询算法如kNN与范围查询-R-tree Index for multi-dimensional data objects, using data objects between the relative position of the establishment of the minimum boundary rectangle (MBR), this structure can be c
f
- 一些查找的程序,第一个是二叉查找树,后面两个是其扩展-Some find the procedure, the first is a binary search tree, behind two of its expansion
BST_path
- 二叉搜索树求每个结点到根节点的路径 非递归的先序,中序,后序遍历-Binary search tree for each node to the root path of the first non-recursive sequence, in order, after the traversal
tree
- 查找序列以带头结点的单链表表示,各结点中设一个访问频度,初始值为 0,每次查找成功后该结点频度值增加 1。试给出算法,在每次查找后查找序列均按访问频度从大到小排列。 -Find a sequence of nodes in order to take the lead in a single list that each node in a visit to the frequency, the initial value of 0, after the success of each to
BinaryTree
- 二叉搜索树的实现,代码来自北大赵海燕老师编著的数据结构与算法。-Binary search tree realization of the code from the Beijing University teacher Zhao Haiyan edited data structure and algorithm.
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
kdtree
- 用matlab编写的k-dtree,加快搜索,在点云拼合中应用广泛。-Matlab prepared with k-dtree, to speed up the search, put together in the point cloud in a wide range of applications.
tree-structure
- 该软件构建了一个二叉树,可以达到在存储数据的时候使用二叉树的规则进行存储,以便在查找的时候比较方便-The software to build a binary tree can be achieved when the stored data in the use of binary tree to store the rules in order to search more convenient time