The Balanced Routing Table is an adaptation of D. Knuth's ART algorithm and requires significantly less memory and has an even better lookup speed.
fast IP to CIDR lookup, longest prefix match in golang
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
A pure Rust implementation of Poptrie, a data structure for efficient longest-prefix matching lookups
🚀 LPM Tries and Hash Set Maps for Go
Building up our own implementation of a significant portion of the Internet - a router, a network interface, and the TCP protocol
🥂 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."