Directed Acyclic Graphs
Improve your DAG pre-processing
We have developed an adaptive framework that can greatly improve the way you pre-process Directed Acyclic Graph (DAGs) to answer reachability and least upper bound lookups for vertex pairs in constant time.
You can download and use the code for free to try it out, and you can see how much quicker it would be for your DAG than what you do at the moment. All we need in return is your feedback.
Our framework builds on the adaptive pre-processing algorithm for constant time reachability lookups...More about about
You can download the source code for the reachability/LCA framework and try it on your own DAGs as well...Access the code