lca alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view lca alternatives based on common mentions on social networks and blogs.
-
arithmoi
Number theory: primes, arithmetic functions, modular computations, special sequences -
imj-animation
Monorepo for a multi-player game engine, and game examples -
search-algorithms
Haskell library containing common graph search algorithms -
-
treeviz
Haskell library for visualizing algorithmic decomposition of computations. -
incremental-sat-solver
Simple, Incremental SAT Solving as a Haskell Library -
integer-logarithms
Integer logarithms, originally split from arithmoi package -
nonlinear-optimization-ad
Wrapper of nonlinear-optimization package for using with ad and backprop packages -
-
edit-distance-vector
Calculate edit scripts and distances between Vectors. -
infinite-search
An implementation of Martin Escardo's exhaustively searchable sets in Haskell. -
graph-generators
A Haskell library for creating random Data.Graph instances using several pop -
-
primesieve
A collection of packages related to math, algorithms and science, in Haskell. -
epanet-haskell
Call the EPANET toolkit via Haskell's Foreign Function Interface -
MIP
Libraries for reading/writing MIP problem files, invoking external MIP solvers, etc. in Haskell -
edit-distance-linear
Levenshtein edit distance in linear memory (also turns out to be faster than C++)
Clean code begins in your IDE with SonarLint
* 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 lca or a related project?
|
Access the most powerful time series database as a service
sponsored
www.influxdata.com
|
Popular Comparisons
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
lca: O(log h) Online Lowest Common Ancestor Search
This package provides a reference implementation of my skew binary random access algorithm for performing an online lowest common ancestor in logarithmic time without preprocessing. This improves the previous known asymptotic bound for this problem from O(h) to O(log h), where h is the height of the tree. Mostly importantly this bound is completely independent of the width or overall size of the tree, enabling you to calculate lowest common ancestors in a distributed fashion with good locality.
While algorithms exist that that provide O(1) query time, they all require O(n) preprocessing, where n is the size of the entire tree, and so are less suitable for LCA search in areas such as revision control where the tree is constantly updated, or distributed computing where the tree may be too large to fit in any one computer's memory.
Slides are available as Purely Functional Data Structures for On-Line LCA
Contact Information
Contributions and bug reports are welcome!
Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.
-Edward Kmett