10

8

6

4

2


9.5

7.9

9.5
0.0

9.3

7.3

9.0

3.0

8.9

3.7

8.5

2.8

63 Algorithms packages and projects

  • arithmoi

    9.5 7.9 Haskell
    Efficient basic number-theoretic functions. Primes, powers, integer logarithms.
  • build

    9.5 0.0 TeX
    Build systems a la carte
  • toysolver

    9.3 7.3 Haskell
    Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc
  • 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.
    Promoted scoutapm.com
  • ersatz

    9.0 3.0 Haskell
    A monad for expressing SAT or QSAT problems using observable sharing.
  • iproute

    8.9 3.7 Haskell
    IP Routing Table
  • graphs

    8.5 2.8 Haskell
    A simple monadic graph library
  • funsat

    8.3 0.0 Groff
    A modern DPLL-style SAT solver
  • aeson-diff

    8.3 2.1 Haskell
    Extract and apply patches to JSON documents.
  • primes

    8.2 0.0 Haskell
    Efficient, purely functional generation of prime numbers
  • HMM

    8.1 0.0 Haskell
    A hidden markov model library
  • union-find

    8.0 0.0 Haskell
    Efficient union and equivalence testing of sets.
  • presburger

    8.0 1.6 Haskell
    A decision procedure for quantifier-free linear arithmetic.
  • imj-animation

    7.6 7.2 Haskell
    Animation Framework
  • text-metrics

    7.6 4.3 Haskell
    Calculate various string metrics efficiently
  • lca

    7.4 2.2 Haskell
    O(log n) persistent on-line lowest common ancestor calculation without preprocessing
  • Adaptive

    7.3 0.0 Haskell
    Library for incremental computing.
  • search-algorithms

    7.2 0.3 Haskell
    Common graph search algorithms
  • dtw

    7.0 0.0 Haskell
    (Fast) Dynamic Time Warping
  • ADPfusion

    6.8 6.4 Haskell
    Efficient, high-level dynamic programming.
  • treeviz

    6.4 0.0 Haskell
    Visualization of computation decomposition trees.
  • edit-distance

    6.3 2.6 Haskell
    Levenshtein and restricted Damerau-Levenshtein edit distances
  • 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 Library
  • ListTree

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

    5.9 0.0 L1 Python
    CMA-ES wrapper in Haskell
  • binary-search

    5.6 0.0 Haskell
    Binary and exponential searches
  • primesieve

    5.3 1.2 Haskell
    FFI bindings for the primesieve library.
  • twentyseven

    5.3 0.0 Haskell
    Rubik's cube solver
  • integer-logarithms

    5.2 3.7 Haskell
    Integer logarithms.
  • TrieMap

    5.1 0.0 Haskell
    Automatic type inference of generalized tries with Template Haskell.
  • DP

    4.9 0.0 Haskell
    Pragmatic framework for dynamic programming
  • GraphSCC

    4.7 0.0 Haskell
    Tarjan's algorithm for computing the strongly connected components of a graph.
  • nonlinear-optimization-ad

    4.7 4.6 Haskell
    Wrapper of nonlinear-optimization package for using with AD package
  • sgd

    4.7 0.0 Haskell
    Stochastic gradient descent
  • union-find-array

    4.5 0.0 Haskell
    union find data structure
  • infinite-search

    4.5 0.0 Haskell
    Exhaustively searchable infinite sets.
  • KMP

    4.5 0.0 Haskell
    Knuth–Morris–Pratt string searching algorithm
  • edit-distance-vector

    4.2 0.0 Haskell
    Calculate edit distances and edit scripts between vectors.
  • graph-generators

    4.2 0.0 Haskell
    Functions for generating structured or random FGL graphs
  • pathfinding

    3.9 0.0 Haskell
    pathfinding in grid and graphs
  • jps

    3.9 0.0 Haskell
    Jump point search for Haskell
  • edit-distance-linear

    3.9 3.0 Haskell
    Efficient implementation of the Levenshtein edit distance in linear memory.
  • adp-multi

    3.6 0.0 Haskell
    ADP for multiple context-free languages
  • spacefill

    3.6 0.0 Python
    Generators for space-filling curves.
  • stable-marriage

    3.6 3.1 Haskell
    algorithms around stable marriage
  • primal

    3.3 9.0 Haskell
    Primeval world of Haskell.
  • epanet-haskell

    3.0 0.0 L2 C
    Haskell binding for EPANET
  • dgim

    2.7 0.0 Haskell
    Implementation of DGIM algorithm
  • learning-hmm

    2.7 0.0 Haskell
    Yet another library for hidden Markov models
  • primes-type

    2.4 0.0 Haskell
    Type-safe prime numbers.
  • bordacount

    2.4 0.0 Haskell
    Implementation of the Borda count election method.
  • pell

    1.9 0.0 Haskell
    Package to solve the Generalized Pell Equation.
  • longshot

    1.9 7.0 Haskell
    Fast Brute-force search using parallelism
  • fibonacci

    1.9 0.0 Haskell
    Fast computation of Fibonacci numbers.
  • ADPfusionSet

    1.6 0.0 Haskell
    Dynamic programming for Set data structures.
  • integer-roots

    1.5 2.6 Haskell
    Integer roots and perfect powers
  • exact-cover

    1.5 0.0 C
    Efficient exact cover solver.
  • kmp-dfa

    1.2 0.0 Haskell
    KMP algorithm implementation based on Deterministic Finite State Automata
  • MIP

    1.2 6.0 Haskell
    Library for using Mixed Integer Programming (MIP)
  • effective-aspects-mzv

    1.2 0.0 Haskell
    A monadic embedding of aspect oriented programming, using "Monads, ...
  • primal-memory

    - -
    Unified interface for memory managemenet.
  • Ritt-Wu

    - -
    Parallel implementation of Ritt-Wu's algorithm.
  • majority

    - -
    Boyer-Moore Majority Vote Algorithm

Add another 'Algorithms' Package