10

8

6

4

2


9.4

8.7
arithmoi

9.1

7.8
toysolver

9.4

7.8
build

3.1

7.1
edit-distance-linear

4.8

7.0
sgd

9.1

5.4
ersatz

57 Algorithms packages and projects

  • arithmoi

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

  • toysolver

    9.1 7.8 Haskell
    Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

  • build

    9.4 7.8 TeX
    Build systems a la carte

  • edit-distance-linear

    3.1 7.1 Haskell
    Efficient implementation of the Levenshtein edit distance in linear memory.

  • sgd

    4.8 7.0 Haskell
    Stochastic gradient descent

  • ersatz

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

  • text-metrics

    7.2 5.1 Haskell
    Calculate various string metrics efficiently

  • graphs

    8.2 3.8 Haskell
    A simple monadic graph library

  • lca

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

  • integer-logarithms

    4.8 3.6 Haskell
    Integer logarithms.

  • iproute

    8.8 3.3 Haskell
    IP Routing Table

  • edit-distance

    7.0 2.7 Haskell
    Levenshtein and restricted Damerau-Levenshtein edit distances

  • aeson-diff

    7.8 2.4 Haskell
    Extract and apply patches to JSON documents.

  • primesieve

    4.3 1.9 Haskell
    FFI bindings for the primesieve library.

  • KMP

    4.3 0.7 Haskell
    Knuth–Morris–Pratt string searching algorithm

  • imj-animation

    7.8 0.4 Haskell
    Animation Framework

  • presburger

    7.4 0.4 Haskell
    A decision procedure for quantifier-free linear arithmetic.

  • qchas

    6.2 0.3 Haskell
    A library for implementing Quantum Algorithms

  • primes

    8.3 0.0 Haskell
    Efficient, purely functional generation of prime numbers

  • nonlinear-optimization-ad

    3.5 0.0 Haskell
    Wrapper of nonlinear-optimization package for using with AD package

  • ListTree

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

  • learning-hmm

    2.5 0.0 Haskell
    Yet another library for hidden Markov models

  • infinite-search

    4.1 0.0 Haskell
    Exhaustively searchable infinite sets.

  • incremental-sat-solver

    6.1 0.0 Haskell
    Simple, Incremental SAT Solving as a Library

  • HMM

    7.9 0.0 Haskell
    A hidden markov model library

  • GraphSCC

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

  • graph-generators

    4.1 0.0 Haskell
    Functions for generating structured or random FGL graphs

  • funsat

    8.1 0.0 Groff
    A modern DPLL-style SAT solver

  • fibonacci

    2.9 0.0 Haskell
    Fast computation of Fibonacci numbers.

  • epanet-haskell

    2.9 0.0 L2 C
    Haskell binding for EPANET

  • edit-distance-vector

    4.8 0.0 Haskell
    Calculate edit distances and edit scripts between vectors.

  • dtw

    6.5 0.0 Haskell
    (Fast) Dynamic Time Warping

  • DP

    4.1 0.0 Haskell
    Pragmatic framework for dynamic programming

  • dgim

    2.5 0.0 Haskell
    Implementation of DGIM algorithm

  • cmaes

    5.0 0.0 L1 Python
    CMA-ES wrapper in Haskell

  • binary-search

    4.6 0.0 Haskell
    Binary and exponential searches

  • ADPfusion

    6.2 0.0 Haskell
    Efficient, high-level dynamic programming.

  • adp-multi

    2.1 0.0 Haskell
    ADP for multiple context-free languages

  • Adaptive

    7.1 0.0 Haskell
    Library for incremental computing.

  • jps

    3.8 0.0 Haskell
    Jump point search for Haskell

  • primes-type

    0.8 0.0 Haskell
    Type-safe prime numbers.

  • bordacount

    0.8 0.0 Haskell
    Implementation of the Borda count election method.

  • kmp-dfa

    0.8 0.0 Haskell
    KMP algorithm implementation based on Deterministic Finite State Automata

  • exact-cover

    0.3 0.0 C
    Efficient exact cover solver.

  • search-algorithms

    5.0 0.0 Haskell
    Common graph search algorithms

  • ADPfusionSet

    1.1 0.0 Haskell
    Dynamic programming for Set data structures.

  • effective-aspects-mzv

    0.8 0.0 Haskell
    A monadic embedding of aspect oriented programming, using "Monads, ...

  • pell

    2.5 0.0 Haskell
    Package to solve the Generalized Pell Equation.

  • treeviz

    6.3 0.0 Haskell
    Visualization of computation decomposition trees.

  • pathfinding

    3.8 0.0 Haskell
    pathfinding in grid and graphs

  • union-find-array

    4.3 0.0 Haskell
    union find data structure

  • union-find

    7.8 0.0 Haskell
    Efficient union and equivalence testing of sets.

  • twentyseven

    2.9 0.0 Haskell
    Rubik's cube solver

  • TrieMap

    4.3 0.0 Haskell
    Automatic type inference of generalized tries with Template Haskell.

  • stable-marriage

    2.5 0.0 Haskell
    algorithms around stable marriage

  • spacefill

    3.5 0.0 Python
    Generators for space-filling curves.

  • majority

    - -
    Boyer-Moore Majority Vote Algorithm

Popular Comparisons

SaaSHub - Software Alternatives and Reviews
View more from us

Add another 'Algorithms' Package