lca: O(log n) persistent on-line lowest common ancestor calculation without preprocessing
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 from
[Skip to Readme]
|Versions [faq]||0.1, 0.1.0.1, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.3, 0.3.1|
|Dependencies||base (>=4 && <4.8) [details]|
|Copyright||Copyright (C) 2011-2012 Edward A. Kmett|
|Author||Edward A. Kmett|
|Maintainer||Edward A. Kmett <firstname.lastname@example.org>|
|Revised||Revision 1 made by HerbertValerioRiedel at Thu Jun 1 09:09:53 UTC 2017|
|Category||Algorithms, Data Structures|
|Source repo||head: git clone git://github.com/ekmett/lca.git|
|Uploaded||by EdwardKmett at Thu Sep 13 07:56:48 UTC 2012|
|Distributions||LTSHaskell:0.3.1, NixOS:0.3.1, Stackage:0.3.1|
|Downloads||5077 total (90 in the last 30 days)|
|Rating||2.0 (votes: 1) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees