Description: The R-tree algorithm, a. If not the root leaf nodes, there are at least two child nodes 2. The number of entities for each non-root and leaf nodes are non-leaf node contains between m and M 3. All leaf nodes at the same level
To Search:
File list (Check if you may need any files):
编程\Debug\T-tree.exe
....\.....\T-tree.ilk
....\.....\T-tree.obj
....\.....\T-tree.pch
....\.....\T-tree.pdb
....\.....\T_tree.bsc
....\.....\T_tree.exe
....\.....\T_tree.ilk
....\.....\T_tree.obj
....\.....\T_tree.pch
....\.....\T_tree.pdb
....\.....\T_tree.sbr
....\.....\vc60.idb
....\.....\vc60.pdb
....\T-tree.cpp
....\T-tree.dsp
....\T-tree.dsw
....\T-tree.h
....\T-tree.ncb
....\T-tree.opt
....\T-tree.plg
....\T_tree.cpp
....\T_tree.dsp
....\T_tree.dsw
....\T_tree.ncb
....\T_tree.opt
....\T_tree.plg
....\Debug
编程
Download