收錄的是《分形算法與程序設(shè)計(jì)VC版》文件夾<第3章VC>包括： <3_1>：內(nèi)含Koch曲線的LS生成源代碼。雙擊Debug下的Tree.exe文件，程序運(yùn)行；雙擊Tree.dsw文件，進(jìn)入編輯環(huán)境。 <3_2>：內(nèi)含隨機(jī)LS分形樹(shù)源代碼。雙擊Debug下的Tree.exe文件，程序運(yùn)行；雙擊Tree.dsw文件，進(jìn)入編輯環(huán)境。
上傳時(shí)間： 2014-01-02
上傳用戶：gaome
aa tree的算法java實(shí)現(xiàn)程序.十分詳細(xì).可供算法實(shí)現(xiàn)應(yīng)用. 請(qǐng)您用winzip 解壓縮
上傳時(shí)間： 2015-04-24
上傳用戶：asddsd
pair tree 的算法java實(shí)現(xiàn),十分清晰,可供初學(xué)者參考.請(qǐng)用winzip解壓縮
標(biāo)簽： winzip pair java tree
上傳時(shí)間： 2014-12-08
上傳用戶：gtf1207
Tree taglib,生成樹(shù)的標(biāo)簽庫(kù)，使用比較簡(jiǎn)單。Eclipse可以直接運(yùn)用。
標(biāo)簽： taglib Tree 生成樹(shù) 標(biāo)簽
上傳時(shí)間： 2015-04-28
上傳用戶：cuiyashuo
THE DECISION TREE ALGORITHM USED VC
標(biāo)簽： ALGORITHM DECISION TREE USED
上傳時(shí)間： 2014-08-10
上傳用戶：1051290259
B-TREE文件索引源代碼,快速,高效的數(shù)據(jù)文件索引程序.
標(biāo)簽： B-TREE 索引 源代碼 數(shù)據(jù)文件
上傳時(shí)間： 2013-12-29
上傳用戶：nanfeicui
Deleting a node of RB-Tree without recurrence
標(biāo)簽： recurrence Deleting RB-Tree without
上傳時(shí)間： 2015-05-05
上傳用戶：yuzsu
基于內(nèi)容的多媒體數(shù)據(jù)庫(kù)檢索算法： 用于最近鄰搜索的R*-tree算法
標(biāo)簽： tree 算法 多媒體 數(shù)據(jù)庫(kù)檢索
上傳時(shí)間： 2015-05-18
上傳用戶：13517191407
基于內(nèi)容的多媒體數(shù)據(jù)檢索算法SR-Tree，類似于R*-tree和SS-tree的最近鄰搜索
標(biāo)簽： SR-Tree 多媒體數(shù)據(jù) 檢索 算法
上傳時(shí)間： 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.
標(biāo)簽： available libraries Although nearly
上傳時(shí)間： 2014-01-22
上傳用戶：zhoujunzhen
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
