Popularity

7.8

Declining

Activity

3.8

Stars 6

Watchers 15

Forks 6

Last Commit 10 months ago

Monthly Downloads: 34

Programming language: Haskell

License: BSD 3-clause "New" or "Revised" License

Tags: Data Mathematics

Latest version: v0.2.2

digraph alternatives and similar packages

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

lens

10.0 6.8 digraph VS lens

Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
semantic-source

10.0 9.1 digraph VS semantic-source

Parsing, analyzing, and comparing source code across many languages

InfluxDB - Power Real-Time Data Analytics at Scale

Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

Promo www.influxdata.com

hnix

9.9 6.8 digraph VS hnix

A Haskell re-implementation of the Nix expression language
code-builder

9.8 0.0 digraph VS code-builder

Packages for defining APIs, running them, generating client code and documentation.
text

9.8 8.4 digraph VS text

Haskell library for space- and time-efficient operations over Unicode text.
Frames

9.7 6.1 digraph VS Frames

Data frames for tabular data.
cassava

9.7 5.9 digraph VS cassava

A CSV parsing and encoding library optimized for ease of use and high performance
compendium-client

9.7 0.0 digraph VS compendium-client

Mu (μ) is a purely functional framework for building micro services.
unordered-containers

9.7 5.0 digraph VS unordered-containers

Efficient hashing-based container types
massiv

9.7 5.9 digraph VS massiv

Efficient Haskell Arrays featuring Parallel computation
holmes

9.6 0.0 digraph VS holmes

A reference library for constraint-solving with propagators and CDCL.
alfred-margaret

9.5 3.5 digraph VS alfred-margaret

Fast Aho-Corasick string searching
resource-pool

9.5 0.0 digraph VS resource-pool

A high-performance striped resource pooling implementation for Haskell
hashable

9.5 5.7 digraph VS hashable

A class for types that can be converted to a hash value
refined

9.5 1.5 digraph VS refined

Refinement types with static checking
binary

9.5 4.3 digraph VS binary

Efficient, pure binary serialisation using ByteStrings in Haskell.
critbit

9.5 0.0 digraph VS critbit

A Haskell implementation of crit-bit trees.
primitive

9.5 5.9 digraph VS primitive

This package provides various primitive memory-related operations.
caledon

9.4 0.0 digraph VS caledon

higher order dependently typed logic programing
data-msgpack

9.4 digraph VS data-msgpack

A Haskell implementation of MessagePack
hashtables

9.4 1.0 digraph VS hashtables

Mutable hash tables for Haskell, in the ST monad
discrimination

9.4 3.1 digraph VS discrimination

Fast linear time sorting and discrimination for a large class of data types
higgledy

9.4 2.2 digraph VS higgledy

Higher-kinded data via generics
aeson-qq

9.4 3.6 digraph VS aeson-qq

JSON quasiquoter for Haskell
network-msgpack-rpc

9.4 digraph VS network-msgpack-rpc

A MessagePack-RPC Implementation
jump

9.4 0.0 digraph VS jump

Jump start your Haskell development
diskhash

9.4 0.0 digraph VS diskhash

Diskbased (persistent) hashtable
json-autotype

9.4 0.0 digraph VS json-autotype

Automatic Haskell type inference from JSON input
dependent-map

9.3 0.0 digraph VS dependent-map

Dependently-typed finite maps (partial dependent products)
audiovisual

9.3 3.5 digraph VS audiovisual

Extensible records, variants, structs, effects, tangles
reflection

9.3 4.8 digraph VS reflection

Reifies arbitrary Haskell terms into types that can be reflected back into terms
IORefCAS

9.3 3.5 digraph VS IORefCAS

A collection of different packages for CAS based data structures.
dependent-sum

9.3 4.3 digraph VS dependent-sum

Dependent sums and supporting typeclasses for comparing and displaying them
cereal

9.3 0.0 digraph VS cereal

A binary serialization library
certificate

9.3 0.0 digraph VS certificate

Certificate and Key Reader/Writer in haskell
protobuf

9.2 2.6 digraph VS protobuf

An implementation of Google's Protocol Buffers in Haskell.
safecopy

9.2 3.1 digraph VS safecopy

An extension to Data.Serialize with built-in version control
orgmode-parse

9.2 0.0 digraph VS orgmode-parse

Attoparsec parser combinators for parsing org-mode structured text!
streaming

9.2 0.0 digraph VS streaming

An optimized general monad transformer for streaming applications, with a simple prelude of functions
rei

9.2 0.0 digraph VS rei

Process lists easily
bifunctors

9.2 5.6 digraph VS bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables
avro

9.2 4.2 digraph VS avro

Haskell Avro Encoding and Decoding Native Support (no RPC)
scientific

9.2 0.0 digraph VS scientific

Arbitrary-precision floating-point numbers represented using scientific notation
MemoTrie

9.1 2.7 digraph VS MemoTrie

Trie-based memo functions
uuid

9.1 2.9 digraph VS uuid

A Haskell library for creating, printing and parsing UUIDs
b-tree

9.1 1.8 digraph VS b-tree

Haskell on-disk B* tree implementation
uuid-types

9.1 2.9 digraph VS uuid-types

A Haskell library for creating, printing and parsing UUIDs
text-icu

9.1 6.1 digraph VS text-icu

This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
witherable

9.1 6.4 digraph VS witherable

Filter with effects
stdio

9.1 1.8 digraph VS stdio

Haskell Standard Input and Output

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

Add another 'Data' Package

Popular Comparisons

README

Directed graphs in adjacency set representation. The implementation is based on Data.HashMap.Strict and Data.HashSet from the unordered-containers package.

Undirected graphs are represented as symmetric, irreflexive directed graphs.

digraph

Directed Graphs

digraph alternatives and similar packages

Popular Comparisons

README