开发工具:
文件大小: 712kb
下载次数: 0
上传时间: 2009-08-12
详细说明： 构造前缀树，深度广度优先搜索等功能。 This library is an implementation of the suffix tree algorithm applied to indexing. A search on "suffix trees Ukkonen" on a search engine should give you an idea of what I'm talking about. The interesting points are a linear indexing time, very little memory consumption (except for a small custom cache used to save some disk access) and a very fast lookup. I don't want to spend much time to detail the algorithm behind the library, in fact once you've read a few papers about the Ukkonen implementation it's pretty straight forward. Note that this implementation has NOT been done in the meaning of finding substring patterns but just to have a fast key/data pair lookup. An example can be found in the archive. It will introduce you to all the functions of the library for storing key/data pairs and retrieving them. See the README file for a few explanations (very few I admit) The new version 1.2 finally includes a dumping and loading tool and the library has now a STdelete() function. 出处：http://sfxdisk.dead-inside.org/ ...展开收缩
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
