Algorithm to find lowest common ancestor in directed acyclic graph?

Question

Imagine a directed acyclic graph as follows, where:

• \"A\" is the root (there is always exactly one root)
• each node knows its parent(s)
• the no

Answer 1

I also need exactly same thing , to find LCA in a DAG (directed acyclic graph). LCA problem is related to RMQ (Range Minimum Query Problem).

It is possible to reduce LCA to RMQ and find desired LCA of two arbitrary node from a directed acyclic graph.

I found THIS TUTORIAL detail and good. I am also planing to implement this.