Trie 数据结构 - Java
声明：本页面是StackOverFlow热门问题的中英对照翻译，遵循CC BY-SA 4.0协议，如果您需要使用它，必须同样遵循CC BY-SA许可，注明原文地址和作者信息，同时你必须将它归于原作者（不是我）：StackOverFlow
原文地址: http://stackoverflow.com/questions/3806788/
Warning: these are provided under cc-by-sa 4.0 license. You are free to use/share it, But you must attribute it to the original authors (not me):
StackOverFlow
Trie data structures - Java
提问by JJunior
Is there any library or documentation/link which gives more information of implementing Trie data structure in java?
是否有任何库或文档/链接提供了在 Java 中实现 Trie 数据结构的更多信息？
Any help would be great!
任何帮助都会很棒！
Thanks.
谢谢。
回答by jkschneider
Another implementation, I believe from Limewire developers originally: https://github.com/rkapsi/patricia-trie
另一种实现，我相信最初来自 Limewire 开发人员：https: //github.com/rkapsi/patricia-trie
回答by Giovanni Botta
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.
在Robert Sedgewick 的关于算法的书中有一个 java 实现。这是非常基本的，即没有压缩和非常简单的界面，但我发现了解尝试的工作原理很有启发性。
I also recently found a librarythat includes a memory efficient concurrent implementation of tries which looks very promising. It even includes a LCS solver using tries.
我最近还发现了一个库，其中包含一个内存高效的尝试并发实现，看起来非常有前途。它甚至包括使用尝试的 LCS 求解器。
There is also the Lucene implementationthat's used in production applications.
还有在生产应用程序中使用的Lucene 实现。
