nary_tree alternatives and similar packages
Based on the "Algorithms and Data structures" category
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.
Do you think we are missing an alternative of nary_tree or a related project?
NaryTree is a pure Elixir implementation of the generic tree data structure. NaryTree implements a data structure for an n-ary tree in which each node has zero or more children. A node in a tree can have arbitrary number of children and depth. Trees are unbalanced and children unordered.
It provides a node-based model to store named nodes in the tree, and provides simple APIs to access, modify and traverse the structure.
Currently only depth-first tree-traversal method is supported.
The library implements Enumerable protocol to allow access to the tree using standard Enum functions (map, reduce, count, etc)
NaryTree supports importing from, and exporting to Map.
This is a MIT licensed open source project, and is hosted at github.com/medhiwidjaja/nary_tree, and is available as a standard Hex package from hex.pm.
View documentation at hexdocs.pm
*Note that all licence references and agreements mentioned in the nary_tree README section above are relevant to that project's source code only.