union-find-array VS arithmoi

Compare union-find-array vs arithmoi and see what are their differences.

union-find-array

ST based union find data structure (by haskell-rewriting)
Algorithms Union
Source Code
Suggest alternative
Edit details

arithmoi

Number theory: primes, arithmetic functions, modular computations, special sequences (by Bodigrim)
Algorithms prime-numbers Primes prime-sieve prime-search prime-factorizations primes-search-algorithm Factorization factorial binomial zeta-functions riemann-zeta dirichlet-character Group
Source Code
hackage.haskell.org
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
union-find-array arithmoi
- 2
1 146
- -
0.0 6.5
almost 3 years ago 4 months ago
Haskell Haskell
MIT License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

union-find-array

Posts with mentions or reviews of union-find-array. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning union-find-array yet.
Tracking mentions began in Dec 2020.

arithmoi

Posts with mentions or reviews of arithmoi. We have used some of these posts to build our list of alternatives and similar projects.

What are some alternatives?

When comparing union-find-array and arithmoi you can also consider the following projects:

pathfinding - Haskell pathfinding library

union-find - Efficient union and equivalence testing of sets.

lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing

incremental-sat-solver - Simple, Incremental SAT Solving as a Haskell Library

twentyseven - Rubik's cube solver in Haskell

epanet-haskell - Call the EPANET toolkit via Haskell's Foreign Function Interface

graph-generators - A Haskell library for creating random Data.Graph instances using several pop

edit-distance-vector - Calculate edit scripts and distances between Vectors.

learning-hmm - Yet another Haskell library for hidden Markov models

spacefill - Space-filling curves

union-find-array vs pathfinding arithmoi vs union-find union-find-array vs lca arithmoi vs incremental-sat-solver union-find-array vs twentyseven arithmoi vs epanet-haskell union-find-array vs graph-generators arithmoi vs edit-distance-vector union-find-array vs union-find arithmoi vs twentyseven union-find-array vs learning-hmm arithmoi vs spacefill