zunama/TernaryTree
Ternary tree for holding lexicon for autocomplete. Memory footprint of tree is not as small as a DAWG but speed is the same.
This is a minimal acyclic finite-state automata algorithm in Java based on the paper, "Incremental Construction of Minimal Acyclic Finite-State Automata".
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
Ternary tree for holding lexicon for autocomplete. Memory footprint of tree is not as small as a DAWG but speed is the same.
Bracktracking solver for sudoku. When all else fails, brute force it. :)