igraph alternatives and similar packages

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

hevm

10.0 4.8 igraph VS hevm

Dapp, Seth, Hevm, and more
Agda

10.0 9.8 igraph VS Agda

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

WorkOS - The modern identity platform for B2B SaaS

The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

Promo workos.com

miso

10.0 6.0 igraph VS miso

:ramen: A tasty Haskell front-end framework
containers

9.8 6.2 igraph VS containers

Assorted concrete container types
vinyl

9.7 0.0 igraph VS vinyl

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

9.7 6.3 igraph VS singletons

Fake dependent types in Haskell using singletons
fgl

9.6 6.6 igraph VS fgl

A Functional Graph Library for Haskell
repa-eval

9.5 0.0 igraph VS repa-eval

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

9.5 0.0 igraph VS repa-scalar

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

9.5 0.0 igraph VS repa-convert

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

9.5 0.0 igraph VS repa-array

High performance, regular, shape polymorphic parallel arrays.
cubical

9.4 0.0 igraph VS cubical

Implementation of Univalence in Cubical Sets
parameterized-utils

9.1 6.1 igraph VS parameterized-utils

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

9.0 0.0 igraph VS hoq

A language based on homotopy type theory with an interval
adjunctions

9.0 3.3 igraph VS adjunctions

Simple adjunctions
ethereum-client-haskell

9.0 0.0 igraph VS ethereum-client-haskell

A Haskell version of an Ethereum client
psqueues

9.0 5.2 igraph VS psqueues

Priority Search Queues in three different flavors for Haskell
distributive

8.9 2.7 igraph VS distributive

Dual Traversable
type-level-sets

8.8 0.0 igraph VS type-level-sets

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

8.7 0.0 igraph VS bookkeeper

Anonymous records and overloaded labels
justified-containers

8.7 0.0 igraph VS justified-containers

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

8.5 3.9 igraph VS clafer

Clafer is a lightweight modeling language
EdisonAPI

8.4 3.7 igraph VS EdisonAPI

Edison: A Library of Efficient Data Structures
ixset-typed

8.2 3.2 igraph VS ixset-typed

More strongly typed variant of the ixset Haskell package
bytestring-trie

8.2 4.6 igraph VS bytestring-trie

An efficient finite map from (byte)strings to values.
slist

8.2 0.0 igraph VS slist

♾️ Sized list
void

8.1 0.0 igraph VS void

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

8.0 0.0 igraph VS heaps

Asymptotically optimal Brodal/Okasaki heaps
hamtmap

7.9 0.0 igraph VS hamtmap

DISCONTINUED. A purely functional and persistent hash map
haggle

7.9 5.0 igraph VS haggle

An efficient graph library for Haskell
knit

7.9 0.0 igraph VS knit

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

7.7 0.0 igraph VS bitset

A compact functional set data structure
multiset

7.7 0.0 igraph VS multiset

multiset haskell package
nonempty-containers

7.6 3.1 igraph VS nonempty-containers

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

7.5 0.0 igraph VS algebra-checkers

checkers for algebra driven design
graphite

7.5 0.0 igraph VS graphite

Haskell graphs and networks library
helf

7.3 3.3 igraph VS helf

Haskell implementation of the Edinburgh Logical Framework
map-exts

7.3 0.0 igraph VS map-exts

Extensions to Data.Map
rawr

7.2 0.0 igraph VS rawr

Anonymous extensible records and variant types
data-r-tree

7.1 4.7 igraph VS data-r-tree

Haskell implementatio of R-Trees
eliminators

7.1 4.5 igraph VS eliminators

Dependently typed elimination functions using singletons
claferIG

6.8 3.9 igraph VS claferIG

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

6.8 0.0 igraph VS TypeCompose

Type composition classes & instances & misc
mtl-c

6.7 0.0 igraph VS mtl-c

Monad transformers in CPS
selections

6.7 0.0 igraph VS selections

Haskell Package for operating with selections over an underlying functor
ixset

6.6 0.0 igraph VS ixset

A Set type which supports multiple indexes
supermonad

6.6 0.0 igraph VS supermonad

A plugin for GHC to support super monads.
map-syntax

6.6 0.0 igraph VS map-syntax

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

6.6 0.0 igraph VS representable-functors

representable functors
hw-fingertree-strict

6.5 0.0 igraph VS hw-fingertree-strict

Generic strict finger-tree structure