dawg 0.0.4

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]https://aclanthology.org/J00-1002.pdf
2. [Compressing Dictionaries with a DAWG]http://stevehanov.ca/blog/?id=115


### 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

<sup>
Licensed under either of <a href="LICENSE-APACHE">Apache License, Version
2.0</a> or <a href="LICENSE-MIT">MIT license</a> at your option.
</sup>


#### 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
4. This is not a feature complete implementation as I have only added some of the features, I need. [see]#future-plans