A = lowestCommonAncestors(D,u,v)
The lowest common ancestors between two vertexSet are the vertexSet that are ancestors of both u and v and are the shortest distance from the vertexSet in the digraph.
|
|
The object lowestCommonAncestors is a method function.
The source of this document is in Graphs.m2:3835:0.