The Balanced Routing Table is an adaptation of D. Knuth's ART algorithm combined with popcount level compression and backtracking. It is somewhat slower than ART, but requires considerably less memory.
fast IP to CIDR lookup, longest prefix match in golang
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
🚀 LPM Tries and Hash Set Maps for Go
🥂 A simple component trie that enables component-granularity longest prefix matching for strings with delimiters.
Add a description, image, and links to the longest-prefix-match topic page so that developers can more easily learn about it.
To associate your repository with the longest-prefix-match topic, visit your repo's landing page and select "manage topics."