Randy-Jordan/trie
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
A trie implementation written in C.
1 Commit 1 Branch 0 Tags 47 KiB
C 91.3%
Makefile 8.7%
36202d86ac
Go to file
Randy Jordan 36202d86ac
Initial commit
2024-11-15 17:08:16 -06:00
include Initial commit 2024-11-15 17:08:16 -06:00
src Initial commit 2024-11-15 17:08:16 -06:00
tests Initial commit 2024-11-15 17:08:16 -06:00
LICENSE Initial commit 2024-11-15 17:08:16 -06:00
Makefile Initial commit 2024-11-15 17:08:16 -06:00
README.md Initial commit 2024-11-15 17:08:16 -06:00

README.md

trie

Description

Prefix tree implementation written in C.

Table of Contents

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
Jacob Sorber - Tries

License

This project is licensed under GPLv3 - see the LICENSE file for details.