Graphs and networks library

graphite alternatives and similar packages

Based on the "Data Structures" category

• Agda

  9.9 9.8 graphite VS Agda

  A dependently typed functional programming language and proof assistant

• miso

  9.9 7.9 graphite VS miso

  A tasty Haskell front-end framework

• containers

  9.8 6.9 graphite VS containers

  Assorted concrete container types

• vinyl

  9.7 8.2 graphite VS vinyl

  Extensible Records

• singletons

  9.6 7.3 graphite VS singletons

  A framework for generating singleton types

• exposed-containers

  9.5 0.0 graphite VS exposed-containers

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

• repa-array

  9.4 3.5 graphite VS repa-array

  Bulk array representations and operators.

• repa-scalar

  9.4 3.5 graphite VS repa-scalar

  Scalar data types and conversions.

• repa-eval

  9.4 3.5 graphite VS repa-eval

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

• repa-convert

  9.4 3.5 graphite VS repa-convert

  Packing and unpacking flat tables.

• cubical

  9.4 0.0 graphite VS cubical

  Implementation of Univalence in Cubical Sets

• parameterized-utils

  9.1 8.1 graphite VS parameterized-utils

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

• ethereum-client-haskell

  9.0 0.0 graphite VS ethereum-client-haskell

  A Haskell version of an Ethereum client

• psqueues

  8.9 3.1 graphite VS psqueues

  Pure priority search queues

• bookkeeper

  8.8 0.0 graphite VS bookkeeper

  Anonymous records and overloaded labels

• hoq

  8.8 0.0 graphite VS hoq

  A language based on homotopy type theory with an interval type

• distributive

  8.7 3.8 graphite VS distributive

  Distributive functors -- Dual to Traversable

• clafer

  8.6 1.4 graphite VS clafer

  Compiles Clafer models to other formats

• type-level-sets

  8.4 2.5 graphite VS type-level-sets

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

• EdisonAPI

  8.3 0.0 graphite VS EdisonAPI

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

• justified-containers

  8.0 0.7 graphite VS justified-containers

  Keyed container types with verified keys.

• void

  7.9 0.0 graphite VS void

  A Haskell 98 logically uninhabited data type

• hamtmap

  7.8 0.0 graphite VS hamtmap

  A purely functional and persistent hash map

• bitset

  7.6 0.0 graphite VS bitset

  A space-efficient set data structure.

• multiset

  7.6 3.9 graphite VS multiset

  The Data.MultiSet container type

• heaps

  7.5 4.8 graphite VS heaps

  Asymptotically optimal Brodal/Okasaki heaps.

• ixset-typed

  7.3 2.0 graphite VS ixset-typed

  Efficient relational queries on Haskell sets.

• rawr

  7.2 0.0 graphite VS rawr

  Anonymous extensible records

• bytestring-trie

  7.2 6.2 graphite VS bytestring-trie

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

• claferIG

  7.1 0.0 graphite VS claferIG

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

• eliminators

  6.8 5.4 graphite VS eliminators

  Dependently typed elimination functions using singletons

• map-exts

  6.8 2.0 graphite VS map-exts

  Extensions to Data.Map

• hw-fingertree-strict

  6.8 5.6 graphite VS hw-fingertree-strict

  Generic strict finger-tree structure

• data-r-tree

  6.7 0.0 graphite VS data-r-tree

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

• mtl-c

  6.4 0.0 graphite VS mtl-c

  Very strict CPS'd transformers

• igraph

  6.3 0.0 graphite VS igraph

  Bindings to the igraph C library.

• map-syntax

  6.2 2.5 graphite VS map-syntax

  Syntax sugar for defining maps

• supermonad

  6.2 0.6 graphite VS supermonad

  Plugin and base library to support supermonads in Haskell

• helf

  6.1 1.2 graphite VS helf

  Typechecking terms of the Edinburgh Logical Framework (LF).

• regional-pointers

  6.0 0.0 graphite VS regional-pointers

  Regional memory pointers

• data-clist

  5.8 1.9 graphite VS data-clist

  Simple functional ring type.

• composition-tree

  5.8 0.0 graphite VS composition-tree

  Composition trees for arbitrary monoids.

• ixset

  5.8 0.6 graphite VS ixset

  Efficient relational queries on Haskell sets.

• DrIFT-cabalized

  5.8 0.0 graphite VS DrIFT-cabalized

  Program to derive type class instances

• DrIFT

  5.8 0.0 graphite VS DrIFT

  Program to derive type class instances

• selections

  5.7 2.7 graphite VS selections

  Combinators for operating with selections over an underlying functor

• heap

  5.7 0.0 graphite VS heap

  Heaps in Haskell

• safer-file-handles

  5.5 0.0 graphite VS safer-file-handles

  Type-safe file handling

• TypeCompose

  5.5 1.9 graphite VS TypeCompose

  Type composition classes & instances

• composition-extra

  5.3 0.0 graphite VS composition-extra

  Combinators for unorthodox structure composition

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

Monitor and correlate metrics, traces, and logs in one platform. Free 14-day trial. More from our partner

Popular Comparisons

• graphite
  vs
  rawr
• graphite
  vs
  bytestring-trie
• graphite
  vs
  bookkeeper
• graphite
  vs
  vinyl
• data-clist
  vs
  pomaps

SaaSHub - Software Alternatives and Reviews More from our team