收錄的是《分形算法與程序設計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
Deleting a node of RB-Tree without recurrence
標簽： recurrence Deleting RB-Tree without
上傳時間： 2015-05-05
上傳用戶：yuzsu
基于內容的多媒體數據庫檢索算法： 用于最近鄰搜索的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
