Untitled attachment

Notices where this attachment appears

1. 🎓 Dr. Freemo :jpf: 🇳🇱 (freemo@qoto.org)'s status on Thursday, 03-Oct-2019 13:14:47 UTC 🎓 Dr. Freemo :jpf: 🇳🇱

   in reply to

   @Absinthe My solution. This should be a somewhat space-optimized solution in ruby based off the modified concept of a Trie.

   https://git.qoto.org/snippets/4

   If i made this into a Radix Trie by compressing nodes with single children down I could reduce this further.

   But since it does work I thought I'd share it as is. I'll update everyone if i decide to finish optimizing this particular solution.

   It does however do a fairly decent job at compressing the tree by making sure no subtree is a duplicate of any other part of the tree (a node of any specific length/id will be the only node with that length.

   For clarity I attached a picture from my notes of what the Trie would look like for the encoded string "12345" where the value inside each circle/node is the "length" value of that node, and the value attached to an arrow/vector/edge is the "chunk" associated with that link. The end result is any path from the minimum node (0) to the maximum node (5). This diagram does not include incomplete paths which my program does right now.

   Incomplete paths can also be trimmed to further reduce the space. But since incomplete paths each add only a single leaf node to the tree, and might be useful for various use cases I decided to keep it.

   #ruby #programming #toyprogrammingchallenge

2. 🎓 Dr. Freemo :jpf: 🇳🇱 (freemo@qoto.org)'s status on Thursday, 03-Oct-2019 13:10:30 UTC 🎓 Dr. Freemo :jpf: 🇳🇱

   in reply to

   @Absinthe My solution. This should be a somewhat space-optimized solution in ruby based off the modified concept of a Trie.

   https://git.qoto.org/snippets/4

   If i made this into a Radix Trie by compressing nodes with single children down I could reduce this further.

   I also need to improve the display function as it does breadth first not depth first thus breaks the optimization right now.

   But since it does work I thought I'd share it as is. I'll update everyone if i decide to finish optimizing this particular solution.

   It does however do a fairly decent job at compressing the tree by making sure no subtree is a duplicate of any other part of the tree (a node of any specific length/id will be the only node with that length.

   For clarity I attached a picture from my notes of what the Trie would look like for the encoded string "12345" where the value inside each circle/node is the "length" value of that node, and the value attached to an arrow/vector/edge is the "chunk" associated with that link. The end result is any path from the minimum node (0) to the maximum node (5). This diagram does not include incomplete paths which my program does right now.

   #ruby #programming #toyprogrammingchallenge

3. 🎓 Dr. Freemo :jpf: 🇳🇱 (freemo@qoto.org)'s status on Thursday, 03-Oct-2019 13:08:59 UTC 🎓 Dr. Freemo :jpf: 🇳🇱

   in reply to

   @Absinthe My solution. This should be a somewhat space-optimized solution in ruby based off the modified concept of a Trie.

   If i made this into a Radix Trie by compressing nodes with single children down I could reduce this further.

   I also need to improve the display function as it does breadth first not depth first thus breaks the optimization right now.

   But since it does work I thought I'd share it as is. I'll update everyone if i decide to finish optimizing this particular solution.

   It does however do a fairly decent job at compressing the tree by making sure no subtree is a duplicate of any other part of the tree (a node of any specific length/id will be the only node with that length.

   For clarity I attached a picture from my notes of what the Trie would look like for the encoded string "12345" where the value inside each circle/node is the "length" value of that node, and the value attached to an arrow/vector/edge is the "chunk" associated with that link. The end result is any path from the minimum node (0) to the maximum node (5). This diagram does not include incomplete paths which my program does right now.