funsat alternatives and similar packages

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

• arithmoi

  9.5 0.0 funsat VS arithmoi

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

• build

  9.5 0.0 funsat VS build

  Build Systems à la Carte

Collect and Analyze Billions of Data Points in Real Time

Manage all types of time series data in a single, purpose-built database. Run at any scale in any environment in the cloud, on-premises, or at the edge.

Promo www.influxdata.com



• toysolver

  9.3 0.0 funsat VS toysolver

  My sandbox for experimenting with solver algorithms.

• ersatz

  8.9 0.0 funsat VS ersatz

  A monad for interfacing with external SAT solvers

• iproute

  8.8 0.0 funsat VS iproute

  IP Routing Table in Haskell

• aeson-diff

  8.4 0.0 funsat VS aeson-diff

  Generate and apply diffs between JSON documents.

• graphs

  8.3 0.0 funsat VS graphs

  a monadic graph library

• primes

  8.1 0.0 funsat VS primes

  Prime Numbers for Haskell

• HMM

  8.0 0.0 funsat VS HMM

  hidden markov models in haskell

• union-find

  7.9 0.0 funsat VS union-find

  Efficient union and equivalence testing of sets.

• search-algorithms

  7.9 0.0 funsat VS search-algorithms

  Haskell library containing common graph search algorithms

• imj-animation

  7.8 3.2 funsat VS imj-animation

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

• presburger

  7.8 0.0 funsat VS presburger

  Decision procedures for Presburger arithmetic in Haskell

• text-metrics

  7.6 0.0 funsat VS text-metrics

  Calculate various string metrics efficiently in Haskell

• lca

  7.5 0.0 funsat VS lca

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

• ADPfusion

  7.4 0.0 funsat VS ADPfusion

  Efficient, high-level dynamic programming

• Adaptive

  6.8 0.0 funsat VS Adaptive

  Library for incremental computing.

• dtw

  6.8 0.0 funsat VS dtw

  Implementation of Dynamic Time Warping in Haskell

• edit-distance

  6.4 0.0 funsat VS edit-distance

  Edit distance library for Haskell
  

• ListTree

  6.3 0.0 funsat VS ListTree

  A List monad transformer and related tools

• integer-logarithms

  6.2 0.0 funsat VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• qchas

  6.1 0.0 funsat VS qchas

  A library for implementing Quantum Algorithms

• treeviz

  6.1 0.0 funsat VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• incremental-sat-solver

  6.0 0.0 funsat VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• binary-search

  6.0 0.0 funsat VS binary-search

  Binary and exponential searches

• cmaes

  5.5 0.0 L1 funsat VS cmaes

  CMA-ES wrapper in Haskell

• twentyseven

  5.5 0.0 funsat VS twentyseven

  Rubik's cube solver in Haskell

• primal

  5.2 0.0 funsat VS primal

  Primitive World of Haskell

• sgd

  5.1 0.0 funsat VS sgd

  Stochastic gradient descent Haskell library

• DP

  5.1 0.0 funsat VS DP

  Holder for a bunch of semirings used in ChartParsing

• GraphSCC

  4.9 0.0 funsat VS GraphSCC

  Tarjan's algorithm for computing strongly connected components

• infinite-search

  4.7 0.0 funsat VS infinite-search

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

• nonlinear-optimization-ad

  4.5 0.0 funsat VS nonlinear-optimization-ad

  Several Haskell packages for numerical optimizations.

• TrieMap

  4.3 0.0 funsat VS TrieMap

  Generalized tries for Haskell

• primesieve

  4.2 1.8 funsat VS primesieve

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

• jps

  4.2 0.0 funsat VS jps

  :point_right: jump point search for Haskell

• spacefill

  4.1 0.0 funsat VS spacefill

  Space-filling curves

• KMP

  4.0 0.0 funsat VS KMP

  Knuth–Morris–Pratt string searching algorithm

• graph-generators

  4.0 0.0 funsat VS graph-generators

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

• edit-distance-vector

  4.0 0.0 funsat VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.

• union-find-array

  4.0 0.0 funsat VS union-find-array

  ST based union find data structure
  

• adp-multi

  3.8 0.0 funsat VS adp-multi

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

• pathfinding

  3.7 0.0 funsat VS pathfinding

  Haskell pathfinding library

• edit-distance-linear

  3.5 0.0 funsat VS edit-distance-linear

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

• dgim

  3.2 0.0 funsat VS dgim

  :chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.

• pell

  2.9 0.0 funsat VS pell

  Haskell Package to solve the Generalized Pell Equation

• epanet-haskell

  2.6 0.0 L2 funsat VS epanet-haskell

  Call the EPANET toolkit via Haskell's Foreign Function Interface

• MIP

  2.6 0.0 funsat VS MIP

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

• longshot

  2.3 0.0 funsat VS longshot

  Fast Brute-force search using parallelism

• stable-marriage

  2.3 0.0 funsat VS stable-marriage

  library around stable marriage algorithms

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

Learn any GitHub repo in 59 seconds sponsored getonboard.dev

Popular Comparisons

• funsat
  vs
  arithmoi
• funsat
  vs
  graph-generators
• funsat
  vs
  incremental-sat-solver
• funsat
  vs
  lca
• funsat
  vs
  twentyseven

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