pathfinding alternatives and similar packages

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

arithmoi

9.5 0.0 pathfinding VS arithmoi

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

9.5 0.0 pathfinding 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 pathfinding VS toysolver

My sandbox for experimenting with solver algorithms.
ersatz

8.9 0.0 pathfinding VS ersatz

A monad for interfacing with external SAT solvers
iproute

8.8 0.0 pathfinding VS iproute

IP Routing Table in Haskell
aeson-diff

8.4 0.0 pathfinding VS aeson-diff

Generate and apply diffs between JSON documents.
graphs

8.3 0.0 pathfinding VS graphs

a monadic graph library
funsat

8.2 0.0 pathfinding VS funsat

An efficient, embeddable DPLL SAT solver in Haskell
primes

8.1 0.0 pathfinding VS primes

Prime Numbers for Haskell
HMM

8.0 0.0 pathfinding VS HMM

hidden markov models in haskell
imj-animation

7.9 3.5 pathfinding VS imj-animation

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

7.9 0.0 pathfinding VS union-find

Efficient union and equivalence testing of sets.
presburger

7.8 0.0 pathfinding VS presburger

Decision procedures for Presburger arithmetic in Haskell
text-metrics

7.7 0.0 pathfinding VS text-metrics

Calculate various string metrics efficiently in Haskell
search-algorithms

7.6 0.0 pathfinding VS search-algorithms

Haskell library containing common graph search algorithms
lca

7.5 0.0 pathfinding 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 pathfinding VS ADPfusion

Efficient, high-level dynamic programming
Adaptive

6.8 0.0 pathfinding VS Adaptive

Library for incremental computing.
dtw

6.8 0.0 pathfinding VS dtw

Implementation of Dynamic Time Warping in Haskell
edit-distance

6.4 0.0 pathfinding VS edit-distance

Edit distance library for Haskell
ListTree

6.3 0.0 pathfinding VS ListTree

A List monad transformer and related tools
treeviz

6.2 0.0 pathfinding VS treeviz

Haskell library for visualizing algorithmic decomposition of computations.
qchas

6.1 0.0 pathfinding VS qchas

A library for implementing Quantum Algorithms
binary-search

6.1 0.0 pathfinding VS binary-search

Binary and exponential searches
incremental-sat-solver

6.1 0.0 pathfinding VS incremental-sat-solver

Simple, Incremental SAT Solving as a Haskell Library
integer-logarithms

6.0 0.0 pathfinding VS integer-logarithms

Integer logarithms, originally split from arithmoi package
cmaes

5.7 0.0 L1 pathfinding VS cmaes

CMA-ES wrapper in Haskell
twentyseven

5.7 0.0 pathfinding VS twentyseven

Rubik's cube solver in Haskell
sgd

5.2 0.0 pathfinding VS sgd

Stochastic gradient descent Haskell library
DP

5.2 0.0 pathfinding VS DP

Holder for a bunch of semirings used in ChartParsing
GraphSCC

5.0 0.0 pathfinding VS GraphSCC

Tarjan's algorithm for computing strongly connected components
infinite-search

4.8 0.0 pathfinding VS infinite-search

An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
nonlinear-optimization-ad

4.5 0.0 pathfinding VS nonlinear-optimization-ad

Several Haskell packages for numerical optimizations.
TrieMap

4.5 0.0 pathfinding VS TrieMap

Generalized tries for Haskell
jps

4.4 0.0 pathfinding VS jps

:point_right: jump point search for Haskell
spacefill

4.3 0.0 pathfinding VS spacefill

Space-filling curves
KMP

4.2 0.0 pathfinding VS KMP

Knuth–Morris–Pratt string searching algorithm
union-find-array

4.2 0.0 pathfinding VS union-find-array

ST based union find data structure
edit-distance-vector

4.1 0.0 pathfinding VS edit-distance-vector

Calculate edit scripts and distances between Vectors.
graph-generators

4.1 0.0 pathfinding VS graph-generators

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

3.8 0.0 pathfinding VS adp-multi

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

3.8 0.0 pathfinding VS primal

Primitive World of Haskell
primesieve

3.6 1.7 pathfinding VS primesieve

A collection of packages related to math, algorithms and science, in Haskell.
edit-distance-linear

3.6 0.0 pathfinding VS edit-distance-linear

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

3.4 0.0 pathfinding VS dgim

:chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.
pell

3.1 0.0 pathfinding VS pell

Haskell Package to solve the Generalized Pell Equation
epanet-haskell

2.8 0.0 L2 pathfinding VS epanet-haskell

Call the EPANET toolkit via Haskell's Foreign Function Interface
MIP

2.7 0.0 pathfinding VS MIP

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

2.5 0.0 pathfinding VS fibonacci

Fast computation of Fibonacci numbers in Haskell
longshot

2.4 0.0 pathfinding VS longshot

Fast Brute-force search using parallelism