Haskell Algorithms

63 Algorithms packages and projects

• build

  9.5 2.3 TeX

  Build Systems à la Carte

• arithmoi

  9.5 6.0 Haskell

  Number theory: primes, arithmetic functions, modular computations, special sequences

Scout APM - Leading-edge performance monitoring starting at $39/month

Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

Sponsored scoutapm.com



• toysolver

  9.3 8.8 Haskell

  My sandbox for experimenting with solver algorithms.

• ersatz

  9.0 4.6 Haskell

  A monad for interfacing with external SAT solvers

• iproute

  8.9 0.0 Haskell

  IP Routing Table in Haskell

• graphs

  8.4 0.5 Haskell

  a monadic graph library

• aeson-diff

  8.3 0.0 Haskell

  Generate and apply diffs between JSON documents.

• funsat

  8.3 0.0 Groff

  An efficient, embeddable DPLL SAT solver in Haskell

• primes

  8.2 0.0 Haskell

  Prime Numbers for Haskell

• HMM

  8.1 0.0 Haskell

  hidden markov models in haskell

• presburger

  8.0 0.2 Haskell

  Decision procedures for Presburger arithmetic in Haskell

• union-find

  7.9 0.0 Haskell

  Efficient union and equivalence testing of sets.

• imj-animation

  7.7 5.2 Haskell

  Monorepo for a multi-player game engine, and game examples

• lca

  7.6 0.1 Haskell

  Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing

• text-metrics

  7.6 3.7 Haskell

  Calculate various string metrics efficiently in Haskell

• search-algorithms

  7.2 0.0 Haskell

  Haskell library containing common graph search algorithms

• Adaptive

  7.1 0.0 Haskell

  Library for incremental computing.

• ADPfusion

  6.9 5.0 Haskell

  Efficient, high-level dynamic programming

• dtw

  6.8 0.0 Haskell

  Implementation of Dynamic Time Warping in Haskell

• edit-distance

  6.4 2.1 Haskell

  Edit distance library for Haskell
  

• treeviz

  6.4 0.0 Haskell

  Haskell library for visualizing algorithmic decomposition of computations.

• qchas

  6.3 0.0 Haskell

  A library for implementing Quantum Algorithms

• incremental-sat-solver

  6.3 0.0 Haskell

  Simple, Incremental SAT Solving as a Haskell Library

• binary-search

  6.2 0.0 Haskell

  Binary and exponential searches

• ListTree

  6.0 5.1 Haskell

  A List monad transformer and related tools

• cmaes

  5.8 0.0 L1 Python

  CMA-ES wrapper in Haskell

• integer-logarithms

  5.3 1.4 Haskell

  Integer logarithms, originally split from arithmoi package
  

• GraphSCC

  5.2 0.0 Haskell

  Tarjan's algorithm for computing strongly connected components

• sgd

  5.2 0.0 Haskell

  Stochastic gradient descent Haskell library

• twentyseven

  5.2 0.0 Haskell

  Rubik's cube solver in Haskell

• TrieMap

  5.0 0.0 Haskell

  Generalized tries for Haskell

• KMP

  5.0 0.0 Haskell

  Knuth–Morris–Pratt string searching algorithm

• DP

  4.8 0.0 Haskell

  Holder for a bunch of semirings used in ChartParsing

• nonlinear-optimization-ad

  4.6 0.0 Haskell

  Wrapper of nonlinear-optimization package for using with ad and backprop packages

• primesieve

  4.5 0.2 Haskell

  A collection of packages related to math, algorithms and science, in Haskell.

• infinite-search

  4.3 0.0 Haskell

  An implementation of Martin Escardo's exhaustively searchable sets in Haskell.

• spacefill

  4.3 0.0 Python

  Space-filling curves

• union-find-array

  4.3 0.0 Haskell

  ST based union find data structure
  

• edit-distance-vector

  4.1 0.0 Haskell

  Calculate edit scripts and distances between Vectors.

• graph-generators

  4.0 0.0 Haskell

  A Haskell library for creating random Data.Graph instances using several pop

• pathfinding

  3.8 0.0 Haskell

  Haskell pathfinding library

• edit-distance-linear

  3.7 0.3 Haskell

  Levenshtein edit distance in linear memory (also turns out to be faster than C++)

• jps

  3.7 0.0 Haskell

  :point_right: jump point search for Haskell

• stable-marriage

  3.5 0.4 Haskell

  library around stable marriage algorithms

• adp-multi

  3.5 0.0 Haskell

  Prototype of ADP for MCFL (multiple context-free languages)
  

• primal

  3.2 7.7 Haskell

  Primitive World of Haskell

• epanet-haskell

  2.8 0.0 L2 C

  Call the EPANET toolkit via Haskell's Foreign Function Interface

• dgim

  2.5 0.0 Haskell

  :chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.

• learning-hmm

  2.5 0.0 Haskell

  Yet another Haskell library for hidden Markov models

• bordacount

  2.2 0.0 Haskell

  Haskell implementation of the Borda count election method

• pell

  2.2 0.0 Haskell

  Haskell Package to solve the Generalized Pell Equation

• primes-type

  2.2 0.0 Haskell

  Type-safe prime numbers.

• longshot

  1.8 4.9 Haskell

  Fast Brute-force search using parallelism

• fibonacci

  1.8 0.0 Haskell

  Fast computation of Fibonacci numbers in Haskell

• ADPfusionSet

  1.5 0.0 Haskell

  dynamic programming for set data structures

• MIP

  1.3 3.9 Haskell

  Libraries for reading/writing MIP problem files, invoking external MIP solvers, etc. in Haskell

• exact-cover

  1.3 0.0 C

  Efficient exact cover solver.

• integer-roots

  1.3 0.1 Haskell

  Integer roots and perfect powers of arbitrary precision

• effective-aspects-mzv

  1.0 0.0 Haskell

  A monadic library for aspect-oriented programming in Haskell

• kmp-dfa

  1.0 0.0 Haskell

  KMP algorithm implementation based on Deterministic Finite State Automata

• majority

  - -

  Boyer-Moore Majority Vote Algorithm

• primal-memory

  - -

  Unified interface for memory managemenet.

• Ritt-Wu

  - -

  Parallel implementation of Ritt-Wu's algorithm.

* 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.

SaaSHub - Software Alternatives and Reviews Sponsored www.saashub.com

Popular Comparisons

• fibonacci
  vs
  pell
• arithmoi
  vs
  union-find
• ersatz
  vs
  graphs
• incremental-sat-solver
  vs
  infinite-search
• incremental-sat-solver
  vs
  pathfinding