infinite-search alternatives and similar packages

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

• build

  9.6 3.1 infinite-search VS build

  Build Systems à la Carte
  

• arithmoi

  9.5 5.9 infinite-search VS arithmoi

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

Nutrient - The #1 PDF SDK Library

Bad PDFs = bad UX. Slow load times, broken annotations, clunky UX frustrates users. Nutrient’s PDF SDKs gives seamless document experiences, fast rendering, annotations, real-time collaboration, 100+ features. Used by 10K+ devs, serving ~half a billion users worldwide. Explore the SDK for free.

Promo nutrient.io



• toysolver

  9.3 9.3 infinite-search VS toysolver

  My sandbox for experimenting with solver algorithms.
  

• ersatz

  8.9 5.4 infinite-search VS ersatz

  A monad for interfacing with external SAT solvers
  

• iproute

  8.8 5.7 infinite-search VS iproute

  IP Routing Table in Haskell
  

• aeson-diff

  8.4 0.0 infinite-search VS aeson-diff

  Generate and apply diffs between JSON documents.

• graphs

  8.2 3.8 infinite-search VS graphs

  a monadic graph library

• funsat

  8.2 0.0 infinite-search VS funsat

  An efficient, embeddable DPLL SAT solver in Haskell

• primes

  8.1 0.0 infinite-search VS primes

  Prime Numbers for Haskell

• search-algorithms

  7.9 3.2 infinite-search VS search-algorithms

  Haskell library containing common graph search algorithms
  

• union-find

  7.9 0.0 infinite-search VS union-find

  DISCONTINUED. Efficient union and equivalence testing of sets.

• imj-animation

  7.9 0.0 infinite-search VS imj-animation

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

• HMM

  7.9 0.0 infinite-search VS HMM

  hidden markov models in haskell

• text-metrics

  7.8 4.7 infinite-search VS text-metrics

  Calculate various string metrics efficiently in Haskell
  

• presburger

  7.7 0.0 infinite-search VS presburger

  Decision procedures for Presburger arithmetic in Haskell
  

• lca

  7.4 0.0 infinite-search VS lca

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

• ADPfusion

  7.4 5.1 infinite-search VS ADPfusion

  Efficient, high-level dynamic programming
  

• Adaptive

  6.7 0.0 infinite-search VS Adaptive

  Library for incremental computing.

• dtw

  6.7 0.0 infinite-search VS dtw

  Implementation of Dynamic Time Warping in Haskell
  

• incremental-sat-solver

  6.3 0.0 infinite-search VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• treeviz

  6.3 0.0 infinite-search VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• ListTree

  6.2 0.0 infinite-search VS ListTree

  A List monad transformer and related tools
  

• qchas

  6.1 0.0 infinite-search VS qchas

  DISCONTINUED. A library for implementing Quantum Algorithms

• edit-distance

  6.0 0.0 infinite-search VS edit-distance

  Edit distance library for Haskell
  

• binary-search

  5.7 0.0 infinite-search VS binary-search

  Binary and exponential searches
  

• integer-logarithms

  5.7 3.8 infinite-search VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• primal

  5.5 0.0 infinite-search VS primal

  Primitive World of Haskell
  

• twentyseven

  5.4 0.0 infinite-search VS twentyseven

  Rubik's cube solver in Haskell

• cmaes

  5.4 0.0 L1 infinite-search VS cmaes

  CMA-ES wrapper in Haskell

• sgd

  5.3 0.0 infinite-search VS sgd

  Stochastic gradient descent Haskell library
  

• GraphSCC

  5.1 0.0 infinite-search VS GraphSCC

  Tarjan's algorithm for computing strongly connected components

• primesieve

  5.0 3.8 infinite-search VS primesieve

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

• DP

  4.9 0.0 infinite-search VS DP

  Holder for a bunch of semirings used in ChartParsing

• graph-generators

  4.5 0.0 infinite-search VS graph-generators

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

• adp-multi

  4.3 0.0 infinite-search VS adp-multi

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

• union-find-array

  4.1 3.2 infinite-search VS union-find-array

  ST based union find data structure
  

• TrieMap

  4.1 0.0 infinite-search VS TrieMap

  Generalized tries for Haskell

• jps

  4.1 0.0 infinite-search VS jps

  :point_right: jump point search for Haskell

• KMP

  3.8 0.0 infinite-search VS KMP

  Knuth–Morris–Pratt string searching algorithm

• spacefill

  3.8 0.0 infinite-search VS spacefill

  Space-filling curves

• edit-distance-vector

  3.8 0.0 infinite-search VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.
  

• pathfinding

  3.7 0.0 infinite-search VS pathfinding

  DISCONTINUED. Haskell pathfinding library

• nonlinear-optimization-ad

  3.7 6.7 infinite-search VS nonlinear-optimization-ad

  Several Haskell packages for numerical optimizations.
  

• edit-distance-linear

  3.3 0.0 infinite-search VS edit-distance-linear

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

• fibonacci

  3.1 0.0 infinite-search VS fibonacci

  Fast computation of Fibonacci numbers in Haskell

• dgim

  3.1 0.0 infinite-search VS dgim

  :chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.

• stable-marriage

  3.1 1.1 infinite-search VS stable-marriage

  library around stable marriage algorithms
  

• pell

  2.8 0.0 infinite-search VS pell

  Haskell Package to solve the Generalized Pell Equation

• MIP

  2.5 9.1 infinite-search VS MIP

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

• epanet-haskell

  2.4 0.0 L2 infinite-search VS epanet-haskell

  Call the EPANET toolkit via Haskell's Foreign Function Interface

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

CodeRabbit: AI Code Reviews for Developers

featured coderabbit.ai

Popular Comparisons

• infinite-search
  vs
  incremental-sat-solver
• infinite-search
  vs
  graph-generators
• infinite-search
  vs
  arithmoi
• infinite-search
  vs
  stable-marriage
• infinite-search
  vs
  twentyseven

SaaSHub - Software Alternatives and Reviews

featured www.saashub.com