30 lines
801 B
Markdown
30 lines
801 B
Markdown
|
# trie
|
||
|
|
|
||
|
|
## Description
|
||
|
|
Prefix tree implementation written in C.
|
||
|
|
|
||
|
|
## Table of Contents
|
||
|
|
|
||
|
|
- [Description](#description)
|
||
|
|
- [Features](#features)
|
||
|
|
- [Usage](#usage)
|
||
|
|
- [Credits / Resources](#credits--resources)
|
||
|
|
- [License](#license)
|
||
|
|
|
||
|
|
## Features / TODOS / NOTES
|
||
|
|
|
||
|
|
+ DFS
|
||
|
|
+ Node may be a terminated node. Where values are kept as the "key" has ended.
|
||
|
|
+ Node may have n children, where the children are number of possible unique values.
|
||
|
|
+ Maybe strings or bytes etc.
|
||
|
|
+ Efficient generation of completion lists
|
||
|
|
|
||
|
|
## Usage
|
||
|
|
Just copy and paste into your projects.
|
||
|
|
|
||
|
|
## Credits / Resources
|
||
|
|
[Wikipedia - Trie](https://en.wikipedia.org/wiki/Trie)<br>
|
||
|
|
[Jacob Sorber - Tries](https://www.youtube.com/watch?v=3CbFFVHQrk4)<br>
|
||
|
|
## License
|
||
|
|
This project is licensed under GPLv3 - see the [LICENSE](LICENSE) file for details.
|