10

8

6

4

2


9.0

7.1

9.0

5.2

8.8

8.4

8.5
0.2

8.4
0.0

8.3
0.0

51 Algorithms packages and projects

  • arithmoi

    9.0 7.1 Haskell
    Efficient basic number-theoretic functions. Primes, powers, integer logarithms.
  • ersatz

    9.0 5.2 Haskell
    A monad for expressing SAT or QSAT problems using observable sharing.
  • toysolver

    8.8 8.4 Haskell
    Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc
  • iproute

    8.5 0.2 Haskell
    IP Routing Table
  • funsat

    8.4 0.0 Groff
    A modern DPLL-style SAT solver
  • graphs

    8.3 0.0 Haskell
    A simple monadic graph library
  • 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

    7.7 0.0 Haskell
    Efficient union and equivalence testing of sets.
  • aeson-diff

    7.6 4.3 Haskell
    Extract and apply patches to JSON documents.
  • text-metrics

    7.4 5.9 Haskell
    Calculate various string metrics efficiently
  • dtw

    7.0 0.0 Haskell
    (Fast) Dynamic Time Warping
  • presburger

    7.0 1.4 Haskell
    A decision procedure for quantifier-free linear arithmetic.
  • Adaptive

    6.9 0.0 Haskell
    Library for incremental computing.
  • edit-distance

    6.9 1.0 Haskell
    Levenshtein and restricted Damerau-Levenshtein edit distances
  • incremental-sat-solver

    6.8 0.0 Haskell
    Simple, Incremental SAT Solving as a Library
  • ADPfusion

    6.6 4.2 Haskell
    Efficient, high-level dynamic programming.
  • lca

    6.5 0.0 Haskell
    O(log n) persistent on-line lowest common ancestor calculation without preprocessing
  • treeviz

    6.5 0.0 Haskell
    Visualization of computation decomposition trees.
  • ListTree

    5.7 4.3 Haskell
    Trees and monadic trees expressed as monadic lists where the underlying monad is a list
  • sgd

    5.7 0.0 Haskell
    Stochastic gradient descent
  • edit-distance-vector

    5.1 0.7 Haskell
    Calculate edit distances and edit scripts between vectors.
  • DP

    4.9 0.0 Haskell
    Pragmatic framework for dynamic programming
  • infinite-search

    4.6 0.0 Haskell
    Exhaustively searchable infinite sets.
  • integer-logarithms

    4.3 4.0 Haskell
    Integer logarithms.
  • search-algorithms

    4.3 6.6 Haskell
    Common graph search algorithms
  • cmaes

    4.3 0.0 L1 Python
    CMA-ES wrapper in Haskell
  • KMP

    4.0 0.0 Haskell
    Knuth–Morris–Pratt string searching algorithm
  • union-find-array

    4.0 0.0 Haskell
    union find data structure
  • qchas

    4.0 8.3 Haskell
    A library for implementing Quantum Algorithms
  • nonlinear-optimization-ad

    3.7 0.0 Haskell
    Wrapper of nonlinear-optimization package for using with AD package
  • TrieMap

    3.7 0.0 Haskell
    Automatic type inference of generalized tries with Template Haskell.
  • epanet-haskell

    3.3 0.0 L2 C
    Haskell binding for EPANET
  • pathfinding

    3.3 0.0 Haskell
    pathfinding in grid and graphs
  • GraphSCC

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

    2.8 0.0 Haskell
    Implementation of DGIM algorithm
  • fibonacci

    2.8 0.0 Haskell
    Fast computation of Fibonacci numbers.
  • twentyseven

    2.8 0.0 Haskell
    Rubik's cube solver
  • stable-marriage

    2.8 0.2 Haskell
    algorithms around stable marriage
  • learning-hmm

    2.4 0.0 Haskell
    Yet another library for hidden Markov models
  • spacefill

    2.4 0.0 Python
    Generators for space-filling curves.
  • graph-generators

    2.4 0.0 Haskell
    Functions for generating structured or random FGL graphs
  • adp-multi

    2.4 0.0 Haskell
    ADP for multiple context-free languages
  • binary-search

    1.9 0.0 Haskell
    Binary and exponential searches
  • pell

    1.9 0.3 Haskell
    Package to solve the Generalized Pell Equation.
  • ADPfusionSet

    0.8 5.4 Haskell
    Dynamic programming for Set data structures.
  • kmp-dfa

    0.8 3.1 Haskell
    KMP algorithm implementation based on Deterministic Finite State Automata
  • bordacount

    0.8 2.1 Haskell
    Implementation of the Borda count election method.
  • primesieve

    0.8 4.0 Haskell
    FFI bindings for the primesieve library.
  • effective-aspects-mzv

    0.8 0.0 Haskell
    A monadic embedding of aspect oriented programming, using "Monads, ...
  • exact-cover

    0.3 3.0 C
    Efficient exact cover solver.

Popular Comparisons

Add another 'Algorithms' Package