Bindings to the igraph C library.

igraph alternatives and similar packages

Based on the "Data Structures" category

• miso

  10.0 7.8 igraph VS miso

  A tasty Haskell front-end framework

• Agda

  9.9 9.8 igraph VS Agda

  A dependently typed functional programming language and proof assistant

• hevm

  9.8 8.6 igraph VS hevm

  Ethereum virtual machine evaluator

• containers

  9.8 6.3 igraph VS containers

  Assorted concrete container types

• vinyl

  9.7 5.4 igraph VS vinyl

  Extensible Records

• exposed-containers

  9.6 0.0 igraph VS exposed-containers

  A distribution of the 'containers' package, with all modules exposed.

• singletons

  9.6 7.3 igraph VS singletons

  A framework for generating singleton types

• repa-eval

  9.5 0.0 igraph VS repa-eval

  Low-level parallel operators on bulk random-accessble arrays.

• cubical

  9.5 0.0 igraph VS cubical

  Implementation of Univalence in Cubical Sets

• repa-convert

  9.5 1.4 igraph VS repa-convert

  Packing and unpacking flat tables.

• repa-scalar

  9.5 0.0 igraph VS repa-scalar

  Scalar data types and conversions.

• repa-array

  9.5 1.4 igraph VS repa-array

  Bulk array representations and operators.

• parameterized-utils

  9.3 6.6 igraph VS parameterized-utils

  Classes and data structures for working with data-kind indexed types

• psqueues

  9.1 0.0 igraph VS psqueues

  Pure priority search queues

• hoq

  9.1 0.0 igraph VS hoq

  A language based on homotopy type theory with an interval type

• ethereum-client-haskell

  9.0 0.0 igraph VS ethereum-client-haskell

  A Haskell version of an Ethereum client

• bookkeeper

  8.9 0.0 igraph VS bookkeeper

  Anonymous records and overloaded labels

• distributive

  8.9 4.3 igraph VS distributive

  Distributive functors -- Dual to Traversable

• type-level-sets

  8.8 0.0 igraph VS type-level-sets

  Type-level sets and finite maps (with value-level counterparts)

• clafer

  8.7 0.0 igraph VS clafer

  Compiles Clafer models to other formats

• EdisonAPI

  8.6 0.0 igraph VS EdisonAPI

  A library of efficient, purely-functional data structures (API)

• slist

  8.2 4.3 igraph VS slist

  Sized list

• void

  8.2 3.0 igraph VS void

  A Haskell 98 logically uninhabited data type

• ixset-typed

  8.0 3.8 igraph VS ixset-typed

  Efficient relational queries on Haskell sets.

• knit

  8.0 5.1 igraph VS knit

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

• justified-containers

  8.0 0.7 igraph VS justified-containers

  Keyed container types with verified keys.

• hamtmap

  7.9 0.0 igraph VS hamtmap

  A purely functional and persistent hash map

• multiset

  7.9 2.9 igraph VS multiset

  The Data.MultiSet container type

• bitset

  7.6 0.0 igraph VS bitset

  A space-efficient set data structure.

• heaps

  7.5 4.8 igraph VS heaps

  Asymptotically optimal Brodal/Okasaki heaps.

• rawr

  7.5 0.0 igraph VS rawr

  Anonymous extensible records

• haggle

  7.5 4.5 igraph VS haggle

  A graph library offering mutable, immutable, and inductive graphs

• data-r-tree

  7.4 4.3 igraph VS data-r-tree

  R-Tree is a spatial data structure similar to Quadtrees or B-Trees.

• bytestring-trie

  7.2 6.2 igraph VS bytestring-trie

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

• claferIG

  7.2 0.0 igraph VS claferIG

  claferIG is an interactive tool that generates instances of Clafer models.

• map-exts

  7.1 0.0 igraph VS map-exts

  Extensions to Data.Map

• hw-fingertree-strict

  6.9 6.4 igraph VS hw-fingertree-strict

  Generic strict finger-tree structure

• graphite

  6.9 4.1 igraph VS graphite

  Graphs and networks library

• mtl-c

  6.9 0.0 igraph VS mtl-c

  Very strict CPS'd transformers

• map-syntax

  6.9 3.0 igraph VS map-syntax

  Syntax sugar for defining maps

• eliminators

  6.8 5.4 igraph VS eliminators

  Dependently typed elimination functions using singletons

• nonempty-containers

  6.8 5.1 igraph VS nonempty-containers

  Non-empty variants of containers data types, with full API

• helf

  6.8 0.0 igraph VS helf

  Typechecking terms of the Edinburgh Logical Framework (LF).

• algebra-checkers

  6.7 8.4 igraph VS algebra-checkers

  Model and test API surfaces algebraically

• supermonad

  6.6 0.0 igraph VS supermonad

  Plugin and base library to support supermonads in Haskell

• regional-pointers

  6.6 0.0 igraph VS regional-pointers

  Regional memory pointers

• selections

  6.5 0.1 igraph VS selections

  Combinators for operating with selections over an underlying functor

• safer-file-handles

  6.2 0.0 igraph VS safer-file-handles

  Type-safe file handling

• TypeCompose

  6.2 0.0 igraph VS TypeCompose

  Type composition classes & instances

• composition-tree

  6.1 0.0 igraph VS composition-tree

  Composition trees for arbitrary monoids.

Do you think we are missing an alternative of igraph or a related project?

Add another 'Data Structures' Package

Popular Comparisons

• pomaps
  vs
  data-clist
• justified-containers
  vs
  naperian
• graphite
  vs
  rawr
• ethereum-client-haskell
  vs
  ethereum-analyzer
• permutation
  vs
  multiset