next | previous | forward | backward | up | top | index | toc | Macaulay2 website
Graphs :: lowestCommonAncestors

lowestCommonAncestors -- determines the lowest common ancestors between two vertexSet

Synopsis

Description

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.

i1 : D = digraph({{0,1},{0,2},{2,3},{3,4},{4,2}},EntryMode=>"edges");
i2 : A = lowestCommonAncestors(D,1,3)

o2 = {0}

o2 : List

See also

Ways to use lowestCommonAncestors :

For the programmer

The object lowestCommonAncestors is a method function.