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.

hevm

10.0 4.8 graph-wrapper VS hevm

Dapp, Seth, Hevm, and more
Agda

10.0 9.9 graph-wrapper VS Agda

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

InfluxDB - Purpose built for real-time analytics at any scale.

InfluxDB Platform is powered by columnar analytics, optimized for cost-efficient storage, and built with open data standards.

Promo www.influxdata.com

miso

10.0 6.4 graph-wrapper VS miso

:ramen: A tasty Haskell front-end framework
containers

9.8 6.9 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 8.2 graph-wrapper VS singletons

Fake dependent types in Haskell using singletons
fgl

9.6 6.6 graph-wrapper VS fgl

A Functional Graph Library for Haskell
cubical

9.4 0.0 graph-wrapper VS cubical

Implementation of Univalence in Cubical Sets
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.
repa-scalar

9.4 0.0 graph-wrapper VS repa-scalar

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

9.4 0.0 graph-wrapper VS repa-eval

High performance, regular, shape polymorphic parallel arrays.
parameterized-utils

9.1 4.7 graph-wrapper VS parameterized-utils

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

9.0 3.3 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
hoq

9.0 0.0 graph-wrapper VS hoq

A language based on homotopy type theory with an interval
psqueues

9.0 4.4 graph-wrapper VS psqueues

Priority Search Queues in three different flavors for Haskell
distributive

8.9 2.7 graph-wrapper VS distributive

Dual Traversable
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)
bookkeeper

8.7 0.0 graph-wrapper VS bookkeeper

Anonymous records and overloaded labels
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.5 3.9 graph-wrapper VS clafer

Clafer is a lightweight modeling language
EdisonAPI

8.4 3.7 graph-wrapper VS EdisonAPI

Edison: A Library of Efficient Data Structures
bytestring-trie

8.2 5.4 graph-wrapper VS bytestring-trie

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

8.2 0.0 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
slist

8.1 2.3 graph-wrapper VS slist

♾️ Sized list
haggle

8.1 5.1 graph-wrapper VS haggle

An efficient graph library for Haskell
heaps

8.0 0.0 graph-wrapper VS heaps

Asymptotically optimal Brodal/Okasaki heaps
hamtmap

7.9 0.0 graph-wrapper VS hamtmap

DISCONTINUED. 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
bitset

7.7 0.0 graph-wrapper VS bitset

A compact functional set data structure
nonempty-containers

7.7 4.8 graph-wrapper VS nonempty-containers

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

7.7 0.0 graph-wrapper VS multiset

multiset haskell package
graphite

7.5 0.0 graph-wrapper VS graphite

Haskell graphs and networks library
algebra-checkers

7.5 0.0 graph-wrapper VS algebra-checkers

checkers for algebra driven design
helf

7.4 3.3 graph-wrapper VS helf

Haskell implementation of the Edinburgh Logical Framework
rawr

7.2 0.0 graph-wrapper VS rawr

Anonymous extensible records and variant types
map-exts

7.2 0.0 graph-wrapper VS map-exts

Extensions to Data.Map
data-r-tree

7.1 3.4 graph-wrapper VS data-r-tree

Haskell implementatio of R-Trees
eliminators

7.1 5.0 graph-wrapper VS eliminators

Dependently typed elimination functions using singletons
TypeCompose

6.8 0.0 graph-wrapper VS TypeCompose

Type composition classes & instances & misc
mtl-c

6.7 0.0 graph-wrapper VS mtl-c

Monad transformers in CPS
claferIG

6.7 3.9 graph-wrapper VS claferIG

Support for reasoning on Clafer models by instantiation and counter example generation.
igraph

6.6 0.0 graph-wrapper VS igraph

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

6.6 0.0 graph-wrapper VS representable-functors

representable functors
selections

6.6 0.0 graph-wrapper VS selections

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

6.6 0.0 graph-wrapper VS map-syntax

Syntax sugar and explicit semantics for statically defined maps
ixset

6.5 0.0 graph-wrapper VS ixset

A Set type which supports multiple indexes
supermonad

6.5 0.0 graph-wrapper VS supermonad

A plugin for GHC to support super monads.

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).