graph-wrapper alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view graph-wrapper alternatives based on common mentions on social networks and blogs.

Agda

10.0 9.6 graph-wrapper VS Agda

Agda is a dependently typed programming language / interactive theorem prover.
hevm

10.0 5.7 graph-wrapper VS hevm

Dapp, Seth, Hevm, and more

Collect and Analyze Billions of Data Points in Real Time

Manage all types of time series data in a single, purpose-built database. Run at any scale in any environment in the cloud, on-premises, or at the edge.

Promo www.influxdata.com

miso

10.0 0.0 graph-wrapper VS miso

:ramen: A tasty Haskell front-end framework
containers

9.8 7.8 graph-wrapper VS containers

Assorted concrete container types
vinyl

9.7 0.0 graph-wrapper VS vinyl

Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
singletons

9.7 0.0 graph-wrapper VS singletons

Fake dependent types in Haskell using singletons
fgl

9.6 0.0 graph-wrapper VS fgl

A Functional Graph Library for Haskell
repa-eval

9.4 0.0 graph-wrapper VS repa-eval

High performance, regular, shape polymorphic parallel arrays.
repa-scalar

9.4 0.0 graph-wrapper VS repa-scalar

High performance, regular, shape polymorphic parallel arrays.
repa-convert

9.4 0.0 graph-wrapper VS repa-convert

High performance, regular, shape polymorphic parallel arrays.
repa-array

9.4 0.0 graph-wrapper VS repa-array

High performance, regular, shape polymorphic parallel arrays.
cubical

9.4 0.0 graph-wrapper VS cubical

Implementation of Univalence in Cubical Sets
parameterized-utils

9.1 0.0 graph-wrapper VS parameterized-utils

A set of utilities for using indexed types including containers, equality, and comparison.
adjunctions

9.0 0.0 graph-wrapper VS adjunctions

Simple adjunctions
ethereum-client-haskell

9.0 0.0 graph-wrapper VS ethereum-client-haskell

A Haskell version of an Ethereum client
psqueues

9.0 0.0 graph-wrapper VS psqueues

Priority Search Queues in three different flavors for Haskell
hoq

8.9 0.0 graph-wrapper VS hoq

A language based on homotopy type theory with an interval
distributive

8.9 0.0 graph-wrapper VS distributive

Dual Traversable
bookkeeper

8.8 0.0 graph-wrapper VS bookkeeper

Anonymous records and overloaded labels
type-level-sets

8.8 0.0 graph-wrapper VS type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations)
justified-containers

8.7 0.0 graph-wrapper VS justified-containers

Standard containers, with keys that carry type-level proofs of their own presence.
clafer

8.6 0.0 graph-wrapper VS clafer

Clafer is a lightweight modeling language
EdisonAPI

8.5 0.0 graph-wrapper VS EdisonAPI

Edison: A Library of Efficient Data Structures
slist

8.2 0.0 graph-wrapper VS slist

♾️ Sized list
bytestring-trie

8.2 0.0 graph-wrapper VS bytestring-trie

An efficient finite map from (byte)strings to values.
ixset-typed

8.2 3.6 graph-wrapper VS ixset-typed

More strongly typed variant of the ixset Haskell package
void

8.1 0.0 graph-wrapper VS void

Provides Data.Void, which is in base since ghc 7.8 or so
heaps

8.0 0.0 graph-wrapper VS heaps

Asymptotically optimal Brodal/Okasaki heaps
hamtmap

7.9 0.0 graph-wrapper VS hamtmap

A purely functional and persistent hash map
knit

7.9 0.0 graph-wrapper VS knit

Ties the knot on data structures that reference each other by unique keys
haggle

7.9 0.0 graph-wrapper VS haggle

An efficient graph library for Haskell
bitset

7.8 0.0 graph-wrapper VS bitset

A compact functional set data structure
multiset

7.7 0.0 graph-wrapper VS multiset

multiset haskell package
graphite

7.6 0.0 graph-wrapper VS graphite

Haskell graphs and networks library
nonempty-containers

7.6 0.0 graph-wrapper VS nonempty-containers

Efficient non-empty variants of containers data types, with full API
algebra-checkers

7.5 0.0 graph-wrapper VS algebra-checkers

checkers for algebra driven design
map-exts

7.4 0.0 graph-wrapper VS map-exts

Extensions to Data.Map
rawr

7.3 0.0 graph-wrapper VS rawr

Anonymous extensible records and variant types
data-r-tree

7.2 0.0 graph-wrapper VS data-r-tree

Haskell implementatio of R-Trees
helf

7.2 0.0 graph-wrapper VS helf

Haskell implementation of the Edinburgh Logical Framework
TypeCompose

7.0 0.0 graph-wrapper VS TypeCompose

Type composition classes & instances & misc
eliminators

7.0 0.0 graph-wrapper VS eliminators

Dependently typed elimination functions using singletons
claferIG

6.9 0.0 graph-wrapper VS claferIG

Support for reasoning on Clafer models by instantiation and counter example generation.
mtl-c

6.8 0.0 graph-wrapper VS mtl-c

Monad transformers in CPS
ixset

6.7 0.0 graph-wrapper VS ixset

A Set type which supports multiple indexes
igraph

6.7 0.0 graph-wrapper VS igraph

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

6.7 0.0 graph-wrapper VS supermonad

A plugin for GHC to support super monads.
selections

6.7 0.0 graph-wrapper VS selections

Haskell Package for operating with selections over an underlying functor
map-syntax

6.7 0.0 graph-wrapper VS map-syntax

Syntax sugar and explicit semantics for statically defined maps
representable-functors

6.7 0.0 graph-wrapper VS representable-functors

representable functors

Do you think we are missing an alternative of graph-wrapper or a related project?

Add another 'Data Structures' Package

Popular Comparisons

README

graph-wrapper

A wrapper around the standard Data.Graph with a less awkward interface.

changelog

0.2.6
- Added Eq instance for Graph. (Thanks, @gelisam.)
0.2.5 (changes to 0.2.4.4)
- reachableVertices returns an empty list given a vertex that doesn't exist (instead of throwing an exception).