收录的是《分形算法与程序设计VC版》文件夹<第3章VC>包括： <3_1>：内含Koch曲线的LS生成源代码。双击Debug下的Tree.exe文件，程序运行；双击Tree.dsw文件，进入编辑环境。 <3_2>：内含随机LS分形树源代码。双击Debug下的Tree.exe文件，程序运行；双击Tree.dsw文件，进入编辑环境。
上传时间： 2014-01-02
上传用户：gaome
aa tree的算法java实现程序.十分详细.可供算法实现应用. 请您用winzip 解压缩
上传时间： 2015-04-24
上传用户：asddsd
pair tree 的算法java实现,十分清晰,可供初学者参考.请用winzip解压缩
上传时间： 2014-12-08
上传用户：gtf1207
Tree taglib,生成树的标签库，使用比较简单。Eclipse可以直接运用。
上传时间： 2015-04-28
上传用户：cuiyashuo
THE DECISION TREE ALGORITHM USED VC
标签： ALGORITHM DECISION TREE USED
上传时间： 2014-08-10
上传用户：1051290259
B-TREE文件索引源代码,快速,高效的数据文件索引程序.
上传时间： 2013-12-29
上传用户：nanfeicui
基于内容的多媒体数据库检索算法： 用于最近邻搜索的R*-tree算法
上传时间： 2015-05-18
上传用户：13517191407
基于内容的多媒体数据检索算法SR-Tree，类似于R*-tree和SS-tree的最近邻搜索
上传时间： 2015-05-18
上传用户：缥缈
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
标签： available libraries Although nearly
上传时间： 2014-01-22
上传用户：zhoujunzhen
with this program you can search your whole driver and list all files in a tree view box.
标签： program driver search files
上传时间： 2013-12-16
上传用户：源弋弋
