ADPfusion
lca
Our great sponsors
ADPfusion | lca | |
---|---|---|
1 | 1 | |
26 | 24 | |
- | - | |
5.1 | 0.0 | |
10 months ago | about 2 years ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
ADPfusion
-
Is Haskell Dynamic Programming Hard?
Might ADPfusion, a Haskell dynamic programming library be what you are looking for? ADPFusion on GitHub.
lca
-
Fastest common prefix algorithm?
And I found another reference: online lowest common ancestor search that is basically using the same tree structure as history trees.
What are some alternatives?
treeviz - Haskell library for visualizing algorithmic decomposition of computations.
edit-distance - Edit distance library for Haskell
graph-generators - A Haskell library for creating random Data.Graph instances using several pop
union-find - Efficient union and equivalence testing of sets.
ADPfusionSet - dynamic programming for set data structures
ersatz - A monad for interfacing with external SAT solvers
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences
edit-distance-vector - Calculate edit scripts and distances between Vectors.
twentyseven - Rubik's cube solver in Haskell
graphs - a monadic graph library
funsat - An efficient, embeddable DPLL SAT solver in Haskell
adp-multi - Prototype of ADP for MCFL (multiple context-free languages)