Categories Algorithms

@hackage/AlanDeniseEricLauren

Find the minimal subset/submap satisfying some property.

@hackage/satchmo-examples

examples that show how to use satchmo

@hackage/algebraic-edge-graphs

A library for algebraic edge-graph construction and transformation

@hackage/number-wall

Create number walls and save them as images

@hackage/imj-animation

Animation Framework

@hackage/dtw

(Fast) Dynamic Time Warping

@hackage/Adaptive

Library for incremental computing.

@hackage/exact-cover

Efficient exact cover solver.

@hackage/primesieve

FFI bindings for the primesieve library.

@hackage/mdp

Tools for solving Markov Decision Processes.

@hackage/batching

An Applicative Functor deferring actions to run in a batch later.

@hackage/GraphSCC

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

@hackage/gutenberg-fibonaccis

The first 1001 Fibonacci numbers, retrieved from the Gutenberg Project.

@hackage/concorde

Simple interface to the Concorde solver for the Traveling Salesperson Problem

@hackage/DifferentialEvolution

Global optimization using Differential Evolution

@hackage/aeson-diff

Extract and apply patches to JSON documents.

@hackage/GA

Genetic algorithm library

@hackage/hqcsim

A library for simulating quantum circuits.

@hackage/hypertypes

Typed ASTs

@hackage/toysolver

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

@hackage/DimensionalHash

An n-dimensional hash using Morton numbers.

@hackage/seqalign

Sequence Alignment

@hackage/primal-memory

Unified interface for memory managemenet.

@hackage/markov-chain

Markov Chains for generating random sequences with a user definable behaviour.

@hackage/patience

Patience diff and longest increasing subsequence

@hackage/HMM

A hidden markov model library

@hackage/epanet-haskell

Haskell binding for EPANET

@hackage/MIP

Library for using Mixed Integer Programming (MIP)

@hackage/adp-multi-monadiccp

Subword construction in adp-multi using monadiccp

@hackage/smartGroup

group strings or bytestrings by words in common

@hackage/quadratic-irrational

An implementation of quadratic irrationals

@hackage/nonlinear-optimization-ad

Wrapper of nonlinear-optimization package for using with AD package

@hackage/typed-session-state-algorithm

Automatically generate status for typed-session.

@hackage/Diff

Diff algorithm in pure Haskell

@hackage/natural-sort

User-friendly text collation

@hackage/grfn

Uniformly-random pre-factored numbers (Kalai)

@hackage/ac-library-hs

Data structures and algorithms

@hackage/sat-micro-hs

A minimal SAT solver

@hackage/Graphalyze

Graph-Theoretic Analysis library.

@hackage/satchmo-toysat

toysat driver as backend for satchmo

@hackage/vector-quicksort

Fast and flexible quicksort implementation for mutable vectors

@hackage/adp-multi

ADP for multiple context-free languages

@hackage/hmm

A hidden markov model library

@hackage/ersatz

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

@hackage/binary-search

Binary and exponential searches

@hackage/rspp

A Rational Street Performer Protocol solver

@hackage/AlignmentAlgorithms

Collection of alignment algorithms

@hackage/outsort

External sorting package based on Conduit

@hackage/set-cover

Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube

@hackage/sgd

Stochastic gradient descent library

@hackage/ersatz-toysat

toysat driver as backend for ersatz

@hackage/fast-arithmetic

Fast functions on integers.

@hackage/presburger

A decision procedure for quantifier-free linear arithmetic.

@hackage/satchmo-backends

driver for external satchmo backends

@hackage/numeric-optimization-backprop

Wrapper of numeric-optimization package for using with backprop package

@hackage/garsia-wachs

A Functional Implementation of the Garsia-Wachs Algorithm

@hackage/MIP-glpk

A GLPK backend to the MIP library.

@hackage/graphs

A simple monadic graph library

@hackage/edit-distance-vector

Calculate edit distances and edit scripts between vectors.

@hackage/qchas

A library for implementing Quantum Algorithms

@hackage/pure-shuffle

@hackage/LinearSplit

Partition the sequence of items to the subsequences in the order given

@hackage/Munkres-simple

Simple and typesafe layer over the Munkres package.

@hackage/satchmo

SAT encoding monad

@hackage/lca

O(log n) persistent online lowest common ancestor search without preprocessing

@hackage/TrieMap

Automatic type inference of generalized tries with Template Haskell.

@hackage/svm-simple

Medium level, simplified, bindings to libsvm

@hackage/assignment

A solution to the assignment problem

@hackage/arithmoi

Efficient basic number-theoretic functions.

@hackage/imj-base

Game engine with geometry, easing, animated text, delta rendering.

@hackage/ChibiHash

a simple and fast 64-bit hash function

@hackage/DP

Pragmatic framework for dynamic programming

@hackage/KMP

Knuth–Morris–Pratt string searching algorithm

@hackage/Binpack

Common bin-packing heuristics.

@hackage/search-algorithms

Common graph search algorithms

@hackage/palindromes

Finding palindromes in strings

@hackage/primes

Efficient, purely functional generation of prime numbers

@hackage/conduit-aeson

Short description

@hackage/numeric-optimization-ad

Wrapper of numeric-optimization package for using with AD package

@hackage/ADPfusionSet

Dynamic programming for Set data structures.

@hackage/primal

Primeval world of Haskell.

@hackage/kmp-dfa

KMP algorithm implementation, based on Deterministic Finite State Automata

@hackage/union-find-array

union find data structure

@hackage/wordsearch

A word search solver library and executable

@hackage/text-metrics

Calculate various string metrics efficiently

@hackage/Munkres

Munkres' assignment algorithm (hungarian method)

@hackage/iproute

IP Routing Table

@hackage/majority

Boyer-Moore Majority Vote Algorithm

@hackage/edit-distance

Levenshtein and restricted Damerau-Levenshtein edit distances

@hackage/moo

Genetic algorithm library

@hackage/integer-roots

Integer roots and perfect powers

@hackage/fibonacci

Fast computation of Fibonacci numbers.

@hackage/PropLogic

Propositional Logic

@cardano/moo

Genetic algorithm library

@hackage/learning-hmm

Yet another library for hidden Markov models

@hackage/Numbers

An assortment of number theoretic functions

@hackage/hlcm

Fast algorithm for mining closed frequent itemsets

@hackage/genprog

Genetic programming library

@hackage/edit-distance-linear

Efficient implementation of the Levenshtein edit distance in linear memory.

@hackage/unification-fd

Simple generic unification algorithms.

@hackage/Hungarian-Munkres

A Linear Sum Assignment Problem (LSAP) solver

@hackage/bordacount

Implementation of the Borda count election method.

@hackage/kmeans-par

Sequential and parallel implementations of Lloyd's algorithm.

@hackage/tsne

t-SNE

@hackage/algraph

Graph library using adjacency list representation

@hackage/ADPfusion

Efficient, high-level dynamic programming.

@hackage/twentyseven

Rubik's cube solver

@hackage/collate

An Applicative Functor for extracting parts of a stream of values

@hackage/DecisionTree

A very simple implementation of decision trees for discrete attributes.

@hackage/nonlinear-optimization-backprop

Wrapper of nonlinear-optimization package for using with backprop package

@hackage/integer-logarithms

Integer logarithms.

@hackage/rangemin

Linear range-min algorithms.

@hackage/NumberSieves

Number Theoretic Sieves: primes, factorization, and Euler's Totient

@hackage/graph-generators

Functions for generating structured or random FGL graphs

@hackage/raz

Random Access Zippers

@hackage/pathfinding

pathfinding in grid and graphs

@hackage/equivalence

Maintaining an equivalence relation implemented as union-find using STT.

@hackage/numeric-optimization

Unified interface to various numerical optimization algorithms

@hackage/infinite-search

Exhaustively searchable infinite sets.

@hackage/mempack

Short description

@hackage/dom-lt

The Lengauer-Tarjan graph dominators algorithm.

@hackage/ListTree

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

@hackage/eigen

Eigen C++ library (linear algebra: matrices, sparse matrices, vectors, numerical solvers).

@hackage/cmaes

CMA-ES wrapper in Haskell

@hackage/teams

Graphical modeling tools for sequential teams

@hackage/pqueue-mtl

Fully encapsulated monad transformers with queuelike functionality.

@hackage/stable-marriage

algorithms around stable marriage

@hackage/massiv-serialise

Compatibility of 'massiv' with 'serialise'

@hackage/queuelike

A library of queuelike data structures, both functional and stateful.

@hackage/hps-kmeans

A nice implementation of the k-Means algorithm.

@hackage/libgraph

Store and manipulate data in a graph.

@hackage/build

Build Systems à la Carte

@hackage/algebraic-graphs

A library for algebraic graph construction and transformation

@hackage/incremental-sat-solver

Simple, Incremental SAT Solving as a Library

@hackage/yices-easy

Simple interface to the Yices SMT (SAT modulo theories) solver.

@hackage/maximal-cliques

Enumerate all maximal cliques of a graph.

@hackage/pell

Package to solve the Generalized Pell Equation.

@hackage/jps

Jump point search for Haskell

@hackage/union-find

Efficient union and equivalence testing of sets.

@hackage/concurrent-sa

Concurrent simulated annealing system.

@hackage/satchmo-funsat

funsat driver as backend for satchmo

@hackage/primes-type

Type-safe prime numbers.

@hackage/spacefill

Generators for space-filling curves.

@hackage/heapsort

Heapsort of MArrays as a demo of imperative programming

@hackage/funsat

A modern DPLL-style SAT solver

@hackage/Ritt-Wu

Parallel implementation of Ritt-Wu's algorithm.

@hackage/dgim

Implementation of DGIM algorithm

@hackage/external-sort

Sort large arrays on your hard drive. Kind of like the unix util sort.