A modern DPLL-style SAT solver

funsat alternatives and similar packages

Based on the "Algorithms" category

• arithmoi

  9.4 8.7 funsat VS arithmoi

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

• build

  9.4 7.8 funsat VS build

  Build systems a la carte

• ersatz

  9.1 5.4 funsat VS ersatz

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

• toysolver

  9.1 7.8 funsat VS toysolver

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

• iproute

  8.8 3.3 funsat VS iproute

  IP Routing Table

• primes

  8.3 0.0 funsat VS primes

  Efficient, purely functional generation of prime numbers

• graphs

  8.2 3.8 funsat VS graphs

  A simple monadic graph library

• HMM

  7.9 0.0 funsat VS HMM

  A hidden markov model library

• union-find

  7.8 0.0 funsat VS union-find

  Efficient union and equivalence testing of sets.

• aeson-diff

  7.8 2.4 funsat VS aeson-diff

  Extract and apply patches to JSON documents.

• imj-animation

  7.8 0.4 funsat VS imj-animation

  Animation Framework

• presburger

  7.4 0.4 funsat VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• text-metrics

  7.2 5.1 funsat VS text-metrics

  Calculate various string metrics efficiently

• Adaptive

  7.1 0.0 funsat VS Adaptive

  Library for incremental computing.

• edit-distance

  7.0 2.7 funsat VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• lca

  6.8 3.8 funsat VS lca

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

• dtw

  6.5 0.0 funsat VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.3 0.0 funsat VS treeviz

  Visualization of computation decomposition trees.

• qchas

  6.2 0.3 funsat VS qchas

  A library for implementing Quantum Algorithms

• ADPfusion

  6.2 0.0 funsat VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.1 0.0 funsat VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• ListTree

  5.3 0.0 funsat VS ListTree

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

• search-algorithms

  5.0 0.0 funsat VS search-algorithms

  Common graph search algorithms

• cmaes

  5.0 0.0 L1 funsat VS cmaes

  CMA-ES wrapper in Haskell

• edit-distance-vector

  4.8 0.0 funsat VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• integer-logarithms

  4.8 3.6 funsat VS integer-logarithms

  Integer logarithms.

• sgd

  4.8 7.0 funsat VS sgd

  Stochastic gradient descent

• binary-search

  4.6 0.0 funsat VS binary-search

  Binary and exponential searches

• KMP

  4.3 0.7 funsat VS KMP

  Knuth–Morris–Pratt string searching algorithm

• primesieve

  4.3 1.9 funsat VS primesieve

  FFI bindings for the primesieve library.

• TrieMap

  4.3 0.0 funsat VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• union-find-array

  4.3 0.0 funsat VS union-find-array

  union find data structure

• graph-generators

  4.1 0.0 funsat VS graph-generators

  Functions for generating structured or random FGL graphs

• DP

  4.1 0.0 funsat VS DP

  Pragmatic framework for dynamic programming

• infinite-search

  4.1 0.0 funsat VS infinite-search

  Exhaustively searchable infinite sets.

• pathfinding

  3.8 0.0 funsat VS pathfinding

  pathfinding in grid and graphs

• jps

  3.8 0.0 funsat VS jps

  Jump point search for Haskell

• spacefill

  3.5 0.0 funsat VS spacefill

  Generators for space-filling curves.

• nonlinear-optimization-ad

  3.5 0.0 funsat VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• edit-distance-linear

  3.1 7.1 funsat VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• GraphSCC

  3.1 0.0 funsat VS GraphSCC

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

• fibonacci

  2.9 0.0 funsat VS fibonacci

  Fast computation of Fibonacci numbers.

• twentyseven

  2.9 0.0 funsat VS twentyseven

  Rubik's cube solver

• epanet-haskell

  2.9 0.0 L2 funsat VS epanet-haskell

  Haskell binding for EPANET

• stable-marriage

  2.5 0.0 funsat VS stable-marriage

  algorithms around stable marriage

• pell

  2.5 0.0 funsat VS pell

  Package to solve the Generalized Pell Equation.

• learning-hmm

  2.5 0.0 funsat VS learning-hmm

  Yet another library for hidden Markov models

• dgim

  2.5 0.0 funsat VS dgim

  Implementation of DGIM algorithm

• adp-multi

  2.1 0.0 funsat VS adp-multi

  ADP for multiple context-free languages

• ADPfusionSet

  1.1 0.0 funsat 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 funsat or a related project?

Add another 'Algorithms' Package

Popular Comparisons

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