containers VS graph-wrapper

Compare containers vs graph-wrapper and see what are their differences.

containers

Assorted concrete container types (by haskell)

graph-wrapper

A wrapper around the standard Data.Graph with a less awkward interface (by soenkehahn)
Our great sponsors
  • InfluxDB - Access the most powerful time series database as a service
  • SaaSHub - Software Alternatives and Reviews
containers graph-wrapper
11 0
306 6
0.3% -
3.6 0.0
13 days ago about 4 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License 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.

containers

Posts with mentions or reviews of containers. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-12-30.

graph-wrapper

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

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

What are some alternatives?

When comparing containers and graph-wrapper you can also consider the following projects:

singletons - Fake dependent types in Haskell using singletons

EdisonAPI - Edison: A Library of Efficient Data Structures

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

hevm - Dapp, Seth, Hevm, and more

miso - :ramen: A tasty Haskell front-end framework

psqueues - Priority Search Queues in three different flavors for Haskell

indexed-containers

btree-concurrent - A backend agnostic, concurrent BTree written in Haskell

adjunctions - Simple adjunctions

fgl - A Functional Graph Library for Haskell

distributive - Dual Traversable

graphite - Haskell graphs and networks library