graphs alternatives and similar packages

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

• arithmoi

  9.5 0.0 graphs VS arithmoi

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

• build

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

  My sandbox for experimenting with solver algorithms.

• ersatz

  8.9 0.0 graphs VS ersatz

  A monad for interfacing with external SAT solvers

• iproute

  8.8 0.0 graphs VS iproute

  IP Routing Table in Haskell

• aeson-diff

  8.4 0.0 graphs VS aeson-diff

  Generate and apply diffs between JSON documents.

• funsat

  8.2 0.0 graphs VS funsat

  An efficient, embeddable DPLL SAT solver in Haskell

• primes

  8.1 0.0 graphs VS primes

  Prime Numbers for Haskell

• HMM

  8.0 0.0 graphs VS HMM

  hidden markov models in haskell

• union-find

  7.9 0.0 graphs VS union-find

  Efficient union and equivalence testing of sets.

• imj-animation

  7.9 3.5 graphs VS imj-animation

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

• presburger

  7.8 0.0 graphs VS presburger

  Decision procedures for Presburger arithmetic in Haskell

• text-metrics

  7.7 0.0 graphs VS text-metrics

  Calculate various string metrics efficiently in Haskell

• search-algorithms

  7.6 0.0 graphs VS search-algorithms

  Haskell library containing common graph search algorithms

• lca

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

  Efficient, high-level dynamic programming

• dtw

  6.8 0.0 graphs VS dtw

  Implementation of Dynamic Time Warping in Haskell

• Adaptive

  6.8 0.0 graphs VS Adaptive

  Library for incremental computing.

• edit-distance

  6.4 0.0 graphs VS edit-distance

  Edit distance library for Haskell
  

• ListTree

  6.3 0.0 graphs VS ListTree

  A List monad transformer and related tools

• treeviz

  6.2 0.0 graphs VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• incremental-sat-solver

  6.1 0.0 graphs VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• binary-search

  6.1 0.0 graphs VS binary-search

  Binary and exponential searches

• qchas

  6.1 0.0 graphs VS qchas

  A library for implementing Quantum Algorithms

• integer-logarithms

  6.0 0.0 graphs VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• cmaes

  5.7 0.0 L1 graphs VS cmaes

  CMA-ES wrapper in Haskell

• twentyseven

  5.7 0.0 graphs VS twentyseven

  Rubik's cube solver in Haskell

• DP

  5.2 0.0 graphs VS DP

  Holder for a bunch of semirings used in ChartParsing

• sgd

  5.2 0.0 graphs VS sgd

  Stochastic gradient descent Haskell library

• GraphSCC

  5.0 0.0 graphs VS GraphSCC

  Tarjan's algorithm for computing strongly connected components

• infinite-search

  4.8 0.0 graphs VS infinite-search

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

• TrieMap

  4.5 0.0 graphs VS TrieMap

  Generalized tries for Haskell

• nonlinear-optimization-ad

  4.5 0.0 graphs VS nonlinear-optimization-ad

  Several Haskell packages for numerical optimizations.

• jps

  4.4 0.0 graphs VS jps

  :point_right: jump point search for Haskell

• spacefill

  4.3 0.0 graphs VS spacefill

  Space-filling curves

• KMP

  4.2 0.0 graphs VS KMP

  Knuth–Morris–Pratt string searching algorithm

• union-find-array

  4.2 0.0 graphs VS union-find-array

  ST based union find data structure
  

• graph-generators

  4.1 0.0 graphs VS graph-generators

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

• edit-distance-vector

  4.1 0.0 graphs VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.

• adp-multi

  3.8 0.0 graphs VS adp-multi

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

• primal

  3.8 0.0 graphs VS primal

  Primitive World of Haskell

• pathfinding

  3.7 0.0 graphs VS pathfinding

  Haskell pathfinding library

• primesieve

  3.6 1.7 graphs VS primesieve

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

• edit-distance-linear

  3.6 0.0 graphs VS edit-distance-linear

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

• dgim

  3.4 0.0 graphs VS dgim

  :chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.

• pell

  3.1 0.0 graphs VS pell

  Haskell Package to solve the Generalized Pell Equation

• epanet-haskell

  2.8 0.0 L2 graphs VS epanet-haskell

  Call the EPANET toolkit via Haskell's Foreign Function Interface

• MIP

  2.7 0.0 graphs VS MIP

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

• fibonacci

  2.5 0.0 graphs VS fibonacci

  Fast computation of Fibonacci numbers in Haskell

• longshot

  2.4 0.0 graphs VS longshot

  Fast Brute-force search using parallelism

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

Updating dependencies is time-consuming. sponsored blog.mergify.com

Popular Comparisons

• graphs
  vs
  ersatz
• graphs
  vs
  graph-generators
• graphs
  vs
  arithmoi
• graphs
  vs
  twentyseven
• graphs
  vs
  union-find-array

Clean code begins in your IDE with SonarLint sponsored www.sonarlint.org