All-Pairs Lowest Common Ancestors in Trees and Directed Acyclic Graphs

All-Pairs Lowest Common Ancestors in Trees and Directed Acyclic Graphs, SODA01

There has been interest in the code from our experiments that were published in this SODA 01' paper. Below is a zipped tar archive of our LCA code for trees and for DAGs. Kwong Yung has reported a bug in the O(n) tree code. The bug has been introduced after code refactoring and has not been fixed yet.
[lca.tgz, 16k]

It should expand to:
Code/
Code/rmq-n-opt.c
Code/rmqIn
Code/gendag.c
Code/mm.c
Code/README
Code/GenDagClean/
Code/GenDagClean/README
Code/GenDagClean/mm.c
Code/GenDagClean/naive.c
Code/GenDagClean/main.c
Code/GenDagClean/preprocs.h
Code/GenDagClean/tc.c
Code/GenDagClean/rmq.c