Build systems a la carte

build alternatives and similar packages

Based on the "Algorithms" category

• arithmoi

  9.4 8.7 build VS arithmoi

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

• ersatz

  9.1 5.4 build VS ersatz

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

• toysolver

  9.1 7.8 build VS toysolver

  Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

• iproute

  8.8 3.3 build VS iproute

  IP Routing Table

• primes

  8.3 0.0 build VS primes

  Efficient, purely functional generation of prime numbers

• graphs

  8.2 3.8 build VS graphs

  A simple monadic graph library

• funsat

  8.1 0.0 build VS funsat

  A modern DPLL-style SAT solver

• HMM

  7.9 0.0 build VS HMM

  A hidden markov model library

• union-find

  7.8 0.0 build VS union-find

  Efficient union and equivalence testing of sets.

• aeson-diff

  7.8 2.4 build VS aeson-diff

  Extract and apply patches to JSON documents.

• imj-animation

  7.8 0.4 build VS imj-animation

  Animation Framework

• presburger

  7.4 0.4 build VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• text-metrics

  7.2 5.1 build VS text-metrics

  Calculate various string metrics efficiently

• Adaptive

  7.1 0.0 build VS Adaptive

  Library for incremental computing.

• edit-distance

  7.0 2.7 build VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• lca

  6.8 3.8 build VS lca

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

• dtw

  6.5 0.0 build VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.3 0.0 build VS treeviz

  Visualization of computation decomposition trees.

• ADPfusion

  6.2 0.0 build VS ADPfusion

  Efficient, high-level dynamic programming.

• qchas

  6.2 0.3 build VS qchas

  A library for implementing Quantum Algorithms

• incremental-sat-solver

  6.1 0.0 build VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• ListTree

  5.3 0.0 build VS ListTree

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

• cmaes

  5.0 0.0 L1 build VS cmaes

  CMA-ES wrapper in Haskell

• search-algorithms

  5.0 0.0 build VS search-algorithms

  Common graph search algorithms

• edit-distance-vector

  4.8 0.0 build VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• sgd

  4.8 7.0 build VS sgd

  Stochastic gradient descent

• integer-logarithms

  4.8 3.6 build VS integer-logarithms

  Integer logarithms.

• binary-search

  4.6 0.0 build VS binary-search

  Binary and exponential searches

• TrieMap

  4.3 0.0 build VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• union-find-array

  4.3 0.0 build VS union-find-array

  union find data structure

• primesieve

  4.3 1.9 build VS primesieve

  FFI bindings for the primesieve library.

• KMP

  4.3 0.7 build VS KMP

  Knuth–Morris–Pratt string searching algorithm

• DP

  4.1 0.0 build VS DP

  Pragmatic framework for dynamic programming

• infinite-search

  4.1 0.0 build VS infinite-search

  Exhaustively searchable infinite sets.

• graph-generators

  4.1 0.0 build VS graph-generators

  Functions for generating structured or random FGL graphs

• pathfinding

  3.8 0.0 build VS pathfinding

  pathfinding in grid and graphs

• jps

  3.8 0.0 build VS jps

  Jump point search for Haskell

• spacefill

  3.5 0.0 build VS spacefill

  Generators for space-filling curves.

• nonlinear-optimization-ad

  3.5 0.0 build VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• edit-distance-linear

  3.1 7.1 build VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• GraphSCC

  3.1 0.0 build VS GraphSCC

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

• epanet-haskell

  2.9 0.0 L2 build VS epanet-haskell

  Haskell binding for EPANET

• fibonacci

  2.9 0.0 build VS fibonacci

  Fast computation of Fibonacci numbers.

• twentyseven

  2.9 0.0 build VS twentyseven

  Rubik's cube solver

• stable-marriage

  2.5 0.0 build VS stable-marriage

  algorithms around stable marriage

• dgim

  2.5 0.0 build VS dgim

  Implementation of DGIM algorithm

• pell

  2.5 0.0 build VS pell

  Package to solve the Generalized Pell Equation.

• learning-hmm

  2.5 0.0 build VS learning-hmm

  Yet another library for hidden Markov models

• adp-multi

  2.1 0.0 build VS adp-multi

  ADP for multiple context-free languages

• ADPfusionSet

  1.1 0.0 build VS ADPfusionSet

  Dynamic programming for Set data structures.

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

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

Popular Comparisons

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

SaaSHub - Software Alternatives and Reviews View more from us