LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
-
Updated
Feb 5, 2022 - Go
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
🚀 LPM Tries and Hash Set Maps for Go
Add a description, image, and links to the lpm-trie topic page so that developers can more easily learn about it.
To associate your repository with the lpm-trie topic, visit your repo's landing page and select "manage topics."