Skip to content
forked from bbog/brie-js

Implementation of a Trie structure

Notifications You must be signed in to change notification settings

RetroCIB/brie-js

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 

Repository files navigation

brie-js

My implementation of a Trie structure. Probably not the best and definitely not the only one, but a good learning opportunity for me.

Version 1.0 beta

Usage

You can see a sample usage of this function inside the index.html file

Helpers

The GIT repo contains a small Python helper script as well, used to parse text list with words and turn them into a javascript dictionary

Credits

The trie algorithms were based on a post written by Steve Hanov. http://stevehanov.ca/blog/index.php?id=114

The list of english words used for the demo dictionary was taken from SIL International http://www.sil.org/linguistics/wordlists/english/

License

This code is released under the MIT license.

About

Implementation of a Trie structure

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • JavaScript 100.0%