union-find-array VS graph-generators

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

union-find-array

ST based union find data structure (by haskell-rewriting)

graph-generators

A Haskell library for creating random Data.Graph instances using several pop (by ulikoehler)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
union-find-array graph-generators
- -
1 3
- -
0.0 0.0
almost 3 years ago almost 6 years ago
Haskell Haskell
MIT License Apache License 2.0
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.

graph-generators

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

We haven't tracked posts mentioning graph-generators yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing union-find-array and graph-generators 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

spacefill - Space-filling curves

arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences

twentyseven - Rubik's cube solver in Haskell

ersatz - A monad for interfacing with external SAT solvers

graphs - a monadic graph library

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

primes-type - Type-safe prime numbers.