In graph theory [Graph theory] and combinatorial optimization, a closure of a directed graph [Directed graph] is a set of vertices [Vertices] C, such that no edges [Edge] leave C.
Bibliography
“Closure Problem.” 2020. Wikipedia, November. https://en.wikipedia.org/w/index.php?title=Closure_problem&oldid=990679460.