bn:03585687n
Noun Concept
SYL
No term available
EN
In graph theory and computer science, the lowest common ancestor of two nodes v and w in a tree or directed acyclic graph T is the lowest node that has both v and w as descendants, where we define each node to be a descendant of itself. Wikipedia
Relations
Sources