搜索资源列表
qujianshu
- 本实验完成的功能是给定一个区间找出其区间树 开发环境采用VC-completion of this experiment is to the function of a set interval interval tree to identify its development environment using VC
SegmentTree
- 线段树的样例程序，线段树大家都知道吧？类似于算法导论上的区间树，比AVL好实现多了-segment of the sample program for the tree, the tree line you know? Introduction to the algorithm similar to the interval on the tree, to achieve better than AVL more
IntervalTree
- Introduction to interval tree with examples.
binary_tree.rar
- 根据所输入的一串数字，以“，”间隔，生成一棵二分查找树，生成的树以图像形式出现。,According to the input of a string of figures, interval to generate a binary search tree, the tree generated in the form of images.
Interval-tree-code-realization
- 红黑树的扩展结构-区间树-利用区间树来查找某一个区间-Expansion of red-black tree structure- interval trees- using interval tree to find a certain interval
IntervalTree
- 由红黑树实现区间树算法，实现去检查找，和最小区间的确定。-To achieve range from red and black tree tree algorithm to check the look, and identification of the smallest interval.
PKU2529Msyorsposter
- 一个很好的线段树的题目，每一组数据里面的一个区间是一个不同的颜色，问最后可以看到几种颜色 ....... 要清楚树的是树有多少个节点 .. 代码如下 :-A good segment of the subject tree, each set of data inside an interval is a different color and asked to see the last of several colors to make it clear ....... the tr
IntervalSearch
- 区间树上的重叠区间查找算法:通过增加树结点的信息域将红黑树扩张为区间树，并通过给定的某个区间i，查找区间树上相应的重叠区间。-The overlap interval between the tree search algorithm: tree node by increasing the information domain will be red and black tree expansion for the interval tree, and through a given inte
kc
- 利用区间树实现简易课表管理系统 内有课表范例-Summary schedule of interval tree management system to achieve
PHPK1.1
- PHPK留言墙(仿QQ爱墙) 1.1 功能特色: 全部页面采用DIV+CSS网页标准编写，对搜索引擎超友好 代码简洁，无冗余垃圾功能，登录后可修改密码或删除帖子 可自定义需要过滤的敏感字词，页面显示条数，公告信息 入库数据完善过滤，IP追踪，自定义防灌水防刷暴间隔时间 界面样式替换方便，免费版状如本站演示的仿QQ爱墙样式 代码编写规范，代码完全实现自我注释，非常适合二次开发 后续版将增强功能，但保持简洁第一，并推出插件版/许愿树等 -PHPK messag
interval-tree
- a realization of interval tr-a realization of interval tree
overlap-interval-
- 区间树算法描述，及其说明，使用代码形式来描述区间树问题-The overlap interval between the tree search algorithm
IntervalTree
- 对区间树进行插入，并找到低端点最小重叠区间-Insertion of interval tree, and find low-point minimum overlap interval
IntervalTree
- 本工程实现了算法导论书中区间树查找的算法，可直接运行。-Find the interval tree
algorithms-master
- 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo. 1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。 已实现 ( Implemented ): Array shuffle Prime test(trial division) Prime test(Mi
SectionTree
- 区间树上的查找算法，要求先输入若干区间用来构造红黑树，之后再向树中输入一个查找区间，输出上述区间在树中的重叠区间。需要在红黑树插入操作的基础上进行完成。-Interval tree search algorithm, asked to enter the number of intervals used to construct the red-black tree after tree again enter a search range, the output of the interval
AreaTree
- 区间树的查找，算法实验课的内容，大致实现了一下-Interval tree search algorithm experiments class, roughly achieve a bit
interval_tree
- mm interval_tree.c - interval tree for mapping->i_mmap.
IntervalTree
- 实现有效的区间树查找&删除算法.java实现，编译环境MyEclipse-Implement effective interval tree search & remove algorithm. Java implementation, compile environment is MyEclipse
segment-tree
- 在实际应用中，常遇到与区间有关的操作，比如统计若干矩形并集的面积，记录一个区间的最大最小值及总量，并在区间的插入、删除和修改中维护这些数据。线段树的定义是利用树形二分结构所建立的一种数据结构，能够高效的完成这些操作。-In practical applications, often encountered in the interval-related operations, such as statistics and set a number of rectangular area, rec