aeson-diff VS graph-generators

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

aeson-diff

Generate and apply diffs between JSON documents. (by thsutton)

graph-generators

A Haskell library for creating random Data.Graph instances using several pop (by ulikoehler)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
aeson-diff graph-generators
- -
39 3
- -
0.0 0.0
over 1 year 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.

aeson-diff

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

We haven't tracked posts mentioning aeson-diff 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 aeson-diff 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

iproute - IP Routing Table in Haskell

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

ersatz - A monad for interfacing with external SAT solvers

text-metrics - Calculate various string metrics efficiently in Haskell

graphs - a monadic graph library

primes-type - Type-safe prime numbers.