搜索资源列表
Rplus.tar
- R+树的c实现源码，对应文章T. K. Sellis, N. Roussopoulos, C. Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects.-R tree c achieve source code, corresponding article T. K. Sellis, N. Roussopoulos, C. Faloutsos : The R-Tree : A Dynamic Index for
TV.tar
- TV-tree的c实现源码，对应原文章K.-I. Lin, H. V. Jagadish, C. Faloutsos: The TV-Tree: An Index Structure for High-Dimensional Data.-TV-tree c achieve the source, the original corresponding article K.-I. Lin, H. V. Jagadish, C. Faloutsos : The TV-Tree : An Index S
kthtree
- kthtree问题 给定一棵有向树T，树T 中每个顶点u都有一个权w(u)；树的每条边(u,v)也都有一个 非负边长d(u,v)。有向树T的每个顶点u 可以看作客户，其服务需求量为w(u)。每条边(u,v)的边长d(u,v) 可以看作运输费用。如果在顶点u 处未设置服务机构，则将顶点u 处的服务需求沿有向树的边(u,v)转移到顶点v 处服务机构需付出的服务转移费用为w(u)*d(u,v)。 树根处已设置了服务机构，现在要在树T中增设k处服务机构，使得整棵树T 的服务转移费用最小-kt
c++实现的KNN库:建立高维度的K-d tree
- c++实现的KNN库:建立高维度的K-d tree,实现K邻域搜索，最小半径搜索-K-NN algorithm implementation. It supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions.
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.
huffman_coding
- ) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code t
K-degree-constrained-minimum-spanning-tree
- 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
K-Smallest_Spanning_Trees
- Perharp the smallest spanning tree is trivial, but just take a look with new problem : K Smallest Spanning Tr-Perharp the smallest spanning tree is trivial, but just take a look with new problem : K Smallest Spanning Tree
splay-tree
- 划分树logn 给你n个数 然后让你query从ll到rr中排第k的数-N logn to you by the number of trees and then let you query from ll to rr in the number of rank k
k_d-tree-
- k-d tree的matlab与VC混合实现，可直接使用-using matlab and VC mix programming to realize kd tree.can be used used directly
kd-tree
- knn搜索 利用kd tree 查找最相邻的k个高维空间的点-knn kd-tree
KDTree
- K叉树 < 数据结构与算法分析in C> -K-tree Data Structures And Algorithm Analysis in C
k-Nearest-Neighbor
- K邻近快速算法，包含有独立的样本分解算法，树搜索算法，稍作改动便可以满足各种要求。-K adjacent fast algorithm contains a separate sample decomposition algorithm, the tree search algorithm, some minor changes will meet a variety of requirements.
kd-Tree-On-KNN
- 利用K_D树数据结构实现K邻域搜索的算法代码-K_D tree data structure the K neighborhood search algorithm code
kd-tree
- K-D树的应用文档，适合对K-D树深入学习的同学。文献对K-D树现状和应用有一定的描述-K- D tree application document, suitable for students to K- D tree in-depth study. Literature on K- D describes the present situation and application of a certain tree
Binary-Inddexed-Tree
- 一个树状数组各种改造姿势的模板。除了常规用法单点查询求前缀和外，支持区间修改单点查询、区间修改区间求和、RMQ、离线平衡树以及多维扩展-Many improved versions of binary indexed tree. Which can be used to do these kinds of work in a 1D array: Change one point+k and get the prefixsum Change a range+k and get value
Partition-tree
- 时代的眼泪-划分树 能在对数时间内求取区间第k大值-Partition tree
tree
- 定义二叉树的链式存储结构，实现下列各类应用的递归算法。 （1）构建一棵二叉树，以某种形式（括号表示法、树形表示法、凹入表示法等）输出二叉树，最后释放二叉树的存储内存。 （2）分别编写程序实现：将二叉树的顺序存储结构转换成链式存储结构；将二叉树的链式存储结构转换为顺序存储结构。 （3）实现二叉树的先序、中序、后序和层次序遍历算法。输出二叉树的叶子节点。 （4）分别计算二叉树的所有节点个数，度为0、1、2的节点个数。 （5）统计二叉树中值为k的节点个数。计算二叉树中节点最小的值。 （6）计算二叉树的
tidgleware-tree
- 棋盘覆盖问题：在一个2的k次幂乘以2的k次幂个方格组成的棋盘中,恰有一个方格与其他方格不同,称该方格为一特殊方格,且称该棋()
郁闷的出纳员
- 求第k大的树通过伸展树的特点，每次查询后自动伸展将目标节点通过左旋，右旋直至根节点，这样下一个最大值就可以通过左子树的最右端子树求得。(The largest K tree can be extended automatically after each query, and the target node is left, right to the root node, so that the next maximum value can be obtained through the mos