There's a java implementation in Robert Sedgewick's book on algorithms. It's very basic, i.e., no compression and a very simple interface, but I found it instructive to understand how tries work.
I also recently found a library that includes a memory efficient concurrent implementation of tries which looks very promising. It even includes a LCS solver using tries.
发布评论
评论（3）
您可以阅读 Java Trie 或查看 trie。
You could read up on Java Trie or look at trie.
Robert Sedgewick 的算法书籍中有一个 java 实现。它非常基本，即没有压缩和非常简单的界面，但我发现它对于理解尝试的工作原理很有启发。
我最近还发现了一个库，其中包含一个内存高效的并发尝试实现，看起来非常有希望的。它甚至包括一个使用尝试的 LCS 求解器。
还有 Lucene 实现用于生产应用。
There's a java implementation in Robert Sedgewick's book on algorithms. It's very basic, i.e., no compression and a very simple interface, but I found it instructive to understand how tries work.
I also recently found a library that includes a memory efficient concurrent implementation of tries which looks very promising. It even includes a LCS solver using tries.
There is also the Lucene implementation that's used in production applications.
另一个实现，我相信最初来自 Limewire 开发人员： https://github.com/rkapsi/patricia-trie
Another implementation, I believe from Limewire developers originally: https://github.com/rkapsi/patricia-trie