graphs
a monadic graph library (by ekmett)
lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing (by ekmett)
| graphs | lca | |
|---|---|---|
| - | 1 | |
| 39 | 24 | |
| - | - | |
| 3.8 | 0.0 | |
| 7 months ago | about 2 years ago | |
| Haskell | Haskell | |
| GNU General Public License v3.0 or later | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
graphs
Posts with mentions or reviews of graphs.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning graphs yet.
Tracking mentions began in Dec 2020.
lca
Posts with mentions or reviews of lca.
We have used some of these posts to build our list of alternatives
and similar projects.
-
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?
When comparing graphs and lca you can also consider the following projects:
ersatz - A monad for interfacing with external SAT solvers
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.
twentyseven - Rubik's cube solver in Haskell
ADPfusionSet - dynamic programming for set data structures
edit-distance-vector - Calculate edit scripts and distances between Vectors.
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences
adp-multi - Prototype of ADP for MCFL (multiple context-free languages)
spacefill - Space-filling curves