We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The problem is reffering to sparse array. Prefix tree differs is totaly different structure. Main usage of the prefix tree (trie) is dymanic string matching, while space arrays are good for storing big sparse data in a compact form. Sparse array and matrixes are very common in leaner solvers.
Sparse Arrays
You are viewing a single comment's thread. Return to all comments →
The problem is reffering to sparse array. Prefix tree differs is totaly different structure. Main usage of the prefix tree (trie) is dymanic string matching, while space arrays are good for storing big sparse data in a compact form. Sparse array and matrixes are very common in leaner solvers.