Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.
Features
- Add, Get words, even space containing strings as words
- Clear and Save Dictionary (loading is done separately
- Finding is fast, max. longest word length iterations (restricted to 15)
- When compiling in Pascal (using crt_efd) colored text outputs
- for C++ and Pascal
License
GNU General Public License version 2.0 (GPLv2)Follow jamo Dictionary-tree
Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of jamo Dictionary-tree!