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

数据结构资源文件大小：34 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 - 免费下载

资源简介

源码文件列表

立即下载此资源

资源说明

相关标签

相关资源推荐