A simple monadic graph library

graphs alternatives and similar packages

Based on the "Algorithms" category

• build

  9.5 4.8 graphs VS build

  Build systems a la carte

• arithmoi

  9.4 8.7 graphs VS arithmoi

  Efficient basic number-theoretic functions. Primes, powers, integer logarithms.

• toysolver

  9.3 7.4 graphs VS toysolver

  Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

• ersatz

  9.1 5.3 graphs VS ersatz

  A monad for expressing SAT or QSAT problems using observable sharing.

• iproute

  8.9 4.5 graphs VS iproute

  IP Routing Table

• primes

  8.2 0.0 graphs VS primes

  Efficient, purely functional generation of prime numbers

• HMM

  8.2 0.0 graphs VS HMM

  A hidden markov model library

• funsat

  8.1 0.0 graphs VS funsat

  A modern DPLL-style SAT solver

• presburger

  7.9 0.9 graphs VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• union-find

  7.8 0.0 graphs VS union-find

  Efficient union and equivalence testing of sets.

• aeson-diff

  7.8 2.4 graphs VS aeson-diff

  Extract and apply patches to JSON documents.

• imj-animation

  7.7 0.0 graphs VS imj-animation

  Animation Framework

• text-metrics

  7.7 4.3 graphs VS text-metrics

  Calculate various string metrics efficiently

• lca

  7.5 2.7 graphs VS lca

  O(log n) persistent on-line lowest common ancestor calculation without preprocessing

• search-algorithms

  7.2 2.6 graphs VS search-algorithms

  Common graph search algorithms

• Adaptive

  7.1 0.0 graphs VS Adaptive

  Library for incremental computing.

• dtw

  7.0 0.0 graphs VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.5 0.0 graphs VS treeviz

  Visualization of computation decomposition trees.

• edit-distance

  6.4 2.2 graphs VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• ADPfusion

  6.2 0.0 graphs VS ADPfusion

  Efficient, high-level dynamic programming.

• qchas

  6.2 0.3 graphs VS qchas

  A library for implementing Quantum Algorithms

• incremental-sat-solver

  6.1 0.0 graphs VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• integer-logarithms

  5.4 2.0 graphs VS integer-logarithms

  Integer logarithms.

• ListTree

  5.3 0.0 graphs VS ListTree

  Trees and monadic trees expressed as monadic lists where the underlying monad is a list

• cmaes

  5.0 0.0 L1 graphs VS cmaes

  CMA-ES wrapper in Haskell

• nonlinear-optimization-ad

  4.8 6.2 graphs VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• sgd

  4.8 7.0 graphs VS sgd

  Stochastic gradient descent

• TrieMap

  4.6 0.0 graphs VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• binary-search

  4.6 0.0 graphs VS binary-search

  Binary and exponential searches

• KMP

  4.3 0.7 graphs VS KMP

  Knuth–Morris–Pratt string searching algorithm

• primesieve

  4.3 1.9 graphs VS primesieve

  FFI bindings for the primesieve library.

• union-find-array

  4.3 0.0 graphs VS union-find-array

  union find data structure

• edit-distance-vector

  4.3 0.0 graphs VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• graph-generators

  4.1 0.0 graphs VS graph-generators

  Functions for generating structured or random FGL graphs

• DP

  4.1 0.0 graphs VS DP

  Pragmatic framework for dynamic programming

• infinite-search

  4.1 0.0 graphs VS infinite-search

  Exhaustively searchable infinite sets.

• jps

  4.0 0.0 graphs VS jps

  Jump point search for Haskell

• pathfinding

  4.0 0.0 graphs VS pathfinding

  pathfinding in grid and graphs

• spacefill

  3.8 0.0 graphs VS spacefill

  Generators for space-filling curves.

• edit-distance-linear

  3.1 6.7 graphs VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• GraphSCC

  3.1 0.0 graphs VS GraphSCC

  Tarjan's algorithm for computing the strongly connected components of a graph.

• fibonacci

  2.9 0.0 graphs VS fibonacci

  Fast computation of Fibonacci numbers.

• twentyseven

  2.9 0.0 graphs VS twentyseven

  Rubik's cube solver

• epanet-haskell

  2.9 0.0 L2 graphs VS epanet-haskell

  Haskell binding for EPANET

• dgim

  2.5 0.0 graphs VS dgim

  Implementation of DGIM algorithm

• stable-marriage

  2.5 0.0 graphs VS stable-marriage

  algorithms around stable marriage

• learning-hmm

  2.5 0.0 graphs VS learning-hmm

  Yet another library for hidden Markov models

• primes-type

  2.4 0.0 graphs VS primes-type

  Type-safe prime numbers.

• bordacount

  2.4 0.0 graphs VS bordacount

  Implementation of the Borda count election method.

• adp-multi

  2.1 0.0 graphs VS adp-multi

  ADP for multiple context-free languages

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.

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

Popular Comparisons

• graphs
  vs
  ersatz
• graphs
  vs
  arithmoi
• graphs
  vs
  twentyseven
• graphs
  vs
  lca
• graphs
  vs
  graph-generators

SaaSHub - Software Alternatives and Reviews View more from us