Adaptive VS graph-generators

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

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
Adaptive graph-generators
- -
10 3
- -
0.0 0.0
about 11 years ago almost 6 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" 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.

Adaptive

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

We haven't tracked posts mentioning Adaptive 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 Adaptive and graph-generators you can also consider the following projects:

twentyseven - Rubik's cube solver in Haskell

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

ADPfusionSet - dynamic programming for set data structures

spacefill - Space-filling curves

stable-marriage - library around stable marriage algorithms

TrieMap - Generalized tries for Haskell

ersatz - A monad for interfacing with external SAT solvers

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

graphs - a monadic graph library

iproute - IP Routing Table in Haskell

primes-type - Type-safe prime numbers.