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 know it's and old question and pretty good discussion, but since I had some similar problem to solve I came across JGraphT's Lowest Common Ancestor algorithms, thought this might be of help:

• NativeLcaFinder
• TarjanLowestCommonAncestor