DP alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view DP alternatives based on common mentions on social networks and blogs.

• build

  9.5 0.0 DP VS build

  Build Systems à la Carte

• arithmoi

  9.5 0.0 DP VS arithmoi

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

Static code analysis for 29 languages.

Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

Promo www.sonarqube.org



• toysolver

  9.3 0.0 DP VS toysolver

  My sandbox for experimenting with solver algorithms.

• ersatz

  8.9 0.0 DP VS ersatz

  A monad for interfacing with external SAT solvers

• iproute

  8.8 0.0 DP VS iproute

  IP Routing Table in Haskell

• aeson-diff

  8.5 0.0 DP VS aeson-diff

  Generate and apply diffs between JSON documents.

• graphs

  8.3 0.0 DP VS graphs

  a monadic graph library

• funsat

  8.2 0.0 DP VS funsat

  An efficient, embeddable DPLL SAT solver in Haskell

• primes

  8.2 0.0 DP VS primes

  Prime Numbers for Haskell

• union-find

  7.9 0.0 DP VS union-find

  Efficient union and equivalence testing of sets.

• HMM

  7.9 0.0 DP VS HMM

  hidden markov models in haskell

• presburger

  7.8 0.0 DP VS presburger

  Decision procedures for Presburger arithmetic in Haskell

• imj-animation

  7.8 2.5 DP VS imj-animation

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

• text-metrics

  7.6 0.0 DP VS text-metrics

  Calculate various string metrics efficiently in Haskell

• search-algorithms

  7.5 0.0 DP VS search-algorithms

  Haskell library containing common graph search algorithms

• lca

  7.4 0.0 DP VS lca

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

• ADPfusion

  7.3 0.0 DP VS ADPfusion

  Efficient, high-level dynamic programming

• Adaptive

  6.9 0.0 DP VS Adaptive

  Library for incremental computing.

• dtw

  6.6 0.0 DP VS dtw

  Implementation of Dynamic Time Warping in Haskell

• edit-distance

  6.5 0.0 DP VS edit-distance

  Edit distance library for Haskell
  

• treeviz

  6.3 0.0 DP VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• qchas

  6.3 0.0 DP VS qchas

  A library for implementing Quantum Algorithms

• ListTree

  6.2 0.0 DP VS ListTree

  A List monad transformer and related tools

• incremental-sat-solver

  6.2 0.0 DP VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• integer-logarithms

  6.0 0.0 DP VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• binary-search

  5.8 0.0 DP VS binary-search

  Binary and exponential searches

• twentyseven

  5.4 0.0 DP VS twentyseven

  Rubik's cube solver in Haskell

• cmaes

  5.4 0.0 L1 DP VS cmaes

  CMA-ES wrapper in Haskell

• sgd

  5.3 0.0 DP VS sgd

  Stochastic gradient descent Haskell library

• GraphSCC

  5.2 0.0 DP VS GraphSCC

  Tarjan's algorithm for computing strongly connected components

• nonlinear-optimization-ad

  4.8 0.0 DP VS nonlinear-optimization-ad

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

• TrieMap

  4.6 0.0 DP VS TrieMap

  Generalized tries for Haskell

• infinite-search

  4.4 0.0 DP VS infinite-search

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

• union-find-array

  4.4 0.0 DP VS union-find-array

  ST based union find data structure
  

• edit-distance-vector

  4.4 0.0 DP VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.

• KMP

  4.4 0.0 DP VS KMP

  Knuth–Morris–Pratt string searching algorithm

• primal

  4.1 0.0 DP VS primal

  Primitive World of Haskell

• adp-multi

  4.1 0.0 DP VS adp-multi

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

• graph-generators

  4.1 0.0 DP VS graph-generators

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

• jps

  3.9 0.0 DP VS jps

  :point_right: jump point search for Haskell

• primesieve

  3.9 1.1 DP VS primesieve

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

• pathfinding

  3.7 0.0 DP VS pathfinding

  Haskell pathfinding library

• spacefill

  3.7 0.0 DP VS spacefill

  Space-filling curves

• pell

  3.4 0.0 DP VS pell

  Haskell Package to solve the Generalized Pell Equation

• epanet-haskell

  3.1 0.0 L2 DP VS epanet-haskell

  Call the EPANET toolkit via Haskell's Foreign Function Interface

• edit-distance-linear

  3.0 0.0 DP VS edit-distance-linear

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

• MIP

  3.0 0.0 DP VS MIP

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

• stable-marriage

  2.8 0.0 DP VS stable-marriage

  library around stable marriage algorithms

• primes-type

  2.8 0.0 DP VS primes-type

  Type-safe prime numbers.

• fibonacci

  2.8 0.0 DP VS fibonacci

  Fast computation of Fibonacci numbers in Haskell

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.

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

Access the most powerful time series database as a service sponsored www.influxdata.com

Popular Comparisons

• DP
  vs
  arithmoi
• DP
  vs
  graph-generators
• DP
  vs
  lca
• DP
  vs
  twentyseven
• DP
  vs
  ADPfusionSet

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