dawg 0.0.3

Directed Acyclic Word Graph
Documentation 
Please check the examples folder for a lazy example on how to use this library

References

  1. Incremental Construction of Minimal Acyclic Finite-State Automata
  2. Compressing Dictionaries with a DAWG

Future plans

  1. Add prefix to get all valid words extending from a specific prefix e.g given BAT, we can return BAT, BATHE, BATHS, BATHROOM e.t.c
  2. Add anagrams: to get all possible valid words that can be formed using only the letters in the provided argument e.g given silent, we should can return vec!["listen", "enlist", "silent", "inlets"] e.t.c

License

NOTE:

  1. THIS CRATE IS NOT PRODUCTION READY YET (Use at your own risk)
  2. Contributions are welcome, but I am not actively accepting any at the moment, unless it's really crucial, Sorry
  3. This is not a feature complete implementation as I have only added some of the features, I need. see