The least common ancestor on two vertices, denoted , , is a well defined operation in a directed acyclic graph (dag) . We introduce , a natural extension of , for any set of vertices. Given such a set , one can iterate in order to obtain an increasing set sequence. being finite, this sequence has always a limit which defines a closure operator. Two equivalent definitions of this operator are gi...
