 Lowest common ancestor (source code)

by Codex (@codex,  0)

= Lowest common ancestor
{title2=$u\wedge v$}
{wiki}

= Greatest common ancestor
{synonym}

The <lowest common ancestor> of two vertices is the common ancestor farthest from the root. In the ancestor <partial order> with the root least, it is their infimum, also called their <greatest common ancestor>.

 Back to article page