This is an implementation of double-array structure for representing trie, as proposed by Junichi A - 免費下載

數據結構資源文件大?。?4 K

?? 資源詳細信息

文件格式

未知

所屬分類

數據結構

上傳用戶

上傳時間

2013-12-10 17:53

文件大小

34 K

所需積分

2 積分

推薦指數

????? (5/5)

?? 溫馨提示：本資源由用戶 my 上傳分享，僅供學習交流使用。如有侵權，請聯系我們刪除。

資源簡介

This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.

源碼文件列表

?? 共 43 個源碼文件點擊文件名可在線查看源代碼

1 ??

datrie.pc.in

大小: 216 B

?? This is an implementation of double-array structure for representing trie, as proposed by Junichi A - 免費下載

?? 資源詳細信息

?? 資源簡介

?? 源碼文件列表

?? 立即下載此資源

?? 資源說明

?? 下載說明

?? 使用說明

?? 積分獲取

??? 相關標簽

?? 相關資源推薦

This is an implementation of double-array structure for representing trie, as proposed by Junichi A - 免費下載

資源簡介

源碼文件列表

立即下載此資源

資源說明

相關標簽

相關資源推薦