nary_tree alternatives and similar packages

Based on the "Algorithms and Data structures" category.
Alternatively, view nary_tree alternatives based on common mentions on social networks and blogs.

flow

9.6 3.4 nary_tree VS flow

Computational parallel flows on top of GenStage
witchcraft

9.5 0.0 nary_tree VS witchcraft

Monads and other dark magic for Elixir

WorkOS - The modern identity platform for B2B SaaS

The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

Promo workos.com

fuse

8.9 0.0 nary_tree VS fuse

A Circuit Breaker for Erlang
matrex

8.7 0.0 nary_tree VS matrex

A blazing fast matrix library for Elixir/Erlang with C implementation using CBLAS.
simple_bayes

8.5 0.0 nary_tree VS simple_bayes

A Naive Bayes machine learning implementation in Elixir.
fsm

8.3 0.0 nary_tree VS fsm

Finite State Machine data structure
exconstructor

8.2 5.4 nary_tree VS exconstructor

An Elixir library for generating struct constructors that handle external data with ease.
erlang-algorithms

8.1 0.0 nary_tree VS erlang-algorithms

Implementations of popular data structures and algorithms
monadex

8.0 0.0 nary_tree VS monadex

Upgrade your pipelines with monads.
loom

7.7 0.0 nary_tree VS loom

A CRDT library with δ-CRDT support.
datastructures

7.7 0.0 nary_tree VS datastructures

Datastructures for Elixir.
monad

7.5 0.0 nary_tree VS monad

Monads and do-syntax for Elixir
trie

7.4 3.3 nary_tree VS trie

Erlang Trie Implementation
aja

7.1 6.8 nary_tree VS aja

Extension of the Elixir standard library focused on data stuctures, data manipulation and performance
remodel

7.0 0.0 nary_tree VS remodel

:necktie: An Elixir presenter package used to transform map structures. "ActiveModel::Serializer for Elixir"
lz4

7.0 0.0 L1 nary_tree VS lz4

LZ4 bindings for Erlang
MapDiff

6.7 0.0 nary_tree VS MapDiff

Calculates the difference between two (nested) maps, and returns a map representing the patch of changes.
parallel_stream

6.6 0.0 nary_tree VS parallel_stream

A parallelized stream implementation for Elixir
sfmt

6.4 4.4 nary_tree VS sfmt

sfmt-erlang: SIMD-oriented Fast Mersenne Twister (SFMT) for Erlang
bloomex

6.4 0.0 nary_tree VS bloomex

:hibiscus: A pure Elixir implementation of Scalable Bloom Filters
merkle_tree

6.4 0.0 nary_tree VS merkle_tree

:evergreen_tree: Merkle Tree implementation in pure Elixir
Exads

6.3 0.0 nary_tree VS Exads

Algorithms and Data Structures collection in Elixir
graphmath

6.3 3.1 nary_tree VS graphmath

An Elixir library for performing 2D and 3D mathematics.
the_fuzz

6.0 0.0 nary_tree VS the_fuzz

String metrics and phonetic algorithms for Elixir (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, Refined Soundex, Soundex, Weighted Levenshtein)
DeepMerge

6.0 6.3 nary_tree VS DeepMerge

Deep (recursive) merge for maps, keywords and others in Elixir
exmatrix

5.7 0.0 nary_tree VS exmatrix

Elixir library implementing a parallel matrix multiplication algorithm and other utilities for working with matrices. Used for benchmarking computationally intensive concurrent code.
ecto_materialized_path

5.6 0.0 nary_tree VS ecto_materialized_path

Tree structure & hierarchy for ecto models
dataframe

5.5 0.0 nary_tree VS dataframe

Package providing functionality similar to Python's Pandas or R's data.frame()
blocking_queue

5.2 3.0 nary_tree VS blocking_queue

A blocking queue written in Elixir.
sleeplocks

5.2 0.0 nary_tree VS sleeplocks

BEAM friendly spinlocks for Elixir/Erlang
parex

5.0 0.0 nary_tree VS parex

An elixir module for parallel execution of functions/processes
cuid

5.0 0.0 nary_tree VS cuid

Collision-resistant ids, in Elixir
red_black_tree

5.0 0.0 nary_tree VS red_black_tree

Red-black tree implementation for Elixir.
ratio

4.9 5.2 nary_tree VS ratio

Rational number library for Elixir.
hash_ring_ex

4.7 0.0 nary_tree VS hash_ring_ex

A consistent hash ring implemention for Elixir
Conrex

4.7 0.0 nary_tree VS Conrex

An Elixir implementation of the CONREC algorithm for topographic or isochrone maps.
simhash

4.6 0.0 nary_tree VS simhash

Elixir implementation of Simhash
array

4.4 0.0 nary_tree VS array

An Elixir wrapper library for Erlang's array
murmur

4.4 0.0 nary_tree VS murmur

:speech_balloon: An implementation of the non-cryptographic hash Murmur3
bitmap

4.3 0.0 nary_tree VS bitmap

Bitmap implementation in Elixir using binaries and integers. Fast space efficient data structure for lookups
memoize

4.2 0.0 nary_tree VS memoize

DefMemo - Ryuk's little puppy! Bring apples.
aruspex

4.2 0.0 nary_tree VS aruspex

A configurable constraint solver
Closure Table

4.1 4.9 nary_tree VS Closure Table

Closure Table for Elixir - a simple solution for storing and manipulating complex hierarchies.
qex

4.1 5.4 nary_tree VS qex

Queue data structure for Elixir-lang
cuckoo

4.1 0.0 nary_tree VS cuckoo

:bird: Cuckoo Filters in Elixir
gen_fsm

4.1 0.0 nary_tree VS gen_fsm

Elixir wrapper around OTP's gen_fsm
eastar

4.1 2.8 nary_tree VS eastar

A* graph pathfinding in pure Elixir
luhn

3.8 0.0 nary_tree VS luhn

Luhn algorithm in Elixir
tinymt

3.7 0.0 nary_tree VS tinymt

Tiny Mersenne Twister (TinyMT) for Erlang.
combination

3.7 0.0 nary_tree VS combination

A simple combinatorics library providing combination and permutation.

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.

Do you think we are missing an alternative of nary_tree or a related project?

Add another 'Algorithms and Data structures' Package

Popular Comparisons

README

nary_tree

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.