graph-generators VS union-find

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

graph-generators

A Haskell library for creating random Data.Graph instances using several pop (by ulikoehler)

union-find

Efficient union and equivalence testing of sets. (by nominolo)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
graph-generators union-find
- -
3 27
- -
0.0 0.0
almost 6 years ago about 5 years ago
Haskell Haskell
Apache License 2.0 BSD 3-clause "New" or "Revised" 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.

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.

union-find

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

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

What are some alternatives?

When comparing graph-generators and union-find you can also consider the following projects:

spacefill - Space-filling curves

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

twentyseven - Rubik's cube solver in Haskell

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

ersatz - A monad for interfacing with external SAT solvers

graphs - a monadic graph library

ADPfusionSet - dynamic programming for set data structures

primes-type - Type-safe prime numbers.

union-find-array - ST based union find data structure

iproute - IP Routing Table in Haskell

toysolver - My sandbox for experimenting with solver algorithms.