| 快速构建目录树的算法研究 |
| |
| 引用本文： | 韩卫. 快速构建目录树的算法研究[J]. 南京邮电大学学报(自然科学版), 2009, 9(20) |
| |
| 作者姓名： | 韩卫 |
| |
| 摘 要： | 通常使用DFA和ITA算法构造目录树，本文分别对这两种算法进行了时间复杂性分析，16组实验结果表明DFA算法快于ITA算法。
|
| 关 键 词： | DFA ITA 目录树 |
| 收稿时间： | 2009-06-26 |
| 修稿时间： | 2009-07-13 |
Algorithm research for designing a content tree rapidly |
| |
| HanWei. Algorithm research for designing a content tree rapidly[J]. JJournal of Nanjing University of Posts and Telecommunications, 2009, 9(20) |
| |
| Authors: | HanWei |
| |
| Abstract: | The DFA and ITA are usually used for designing a content tree. The time complexities of DFA and ITA are presented separately. The results of 16 group experiments show that the DFA runs more rapidly than the ITA. |
| |
| Keywords: | DFA ITA content tree |
|
| 点击此处可从《南京邮电大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《南京邮电大学学报(自然科学版)》下载全文 |
